Finding map regions with high density of query keywords  

作　　者：Zhi YU Can WANG Jia-jun BU Xia HU Zhe WANG Jia-he JIN 

机构地区：[1]Alibaba-Zhejiang University Joint Institute of Frontier Technologies, Zhejiang Provincial Key Laboratory of Service Robot, College of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China [2]Hangzhou Science and Technology Information Research Institute, Hangzhou 310001, China

出　　处：《Frontiers of Information Technology & Electronic Engineering》2017年第10期1543-1555,共13页信息与电子工程前沿（英文版）

基　　金：supported by the Zhejiang Provincial Natural Science Foundation of China(No.LZ13F020001);the National Natural Science Foundation of China(Nos.61173185 and 61173186);the National Key Technology R&D Program of China(No.2012BAI34B01);the Hangzhou S&T Development Plan(No.20150834M22)

摘　　要：We consider the problem of finding map regions that best match query keywords. This region search problem can be applied in many practical scenarios such as shopping recommendation, searching for tourist attractions, and collision region detection for wireless sensor networks. While conventional map search retrieves isolate locations in a map, users frequently attempt to find regions of interest instead, e.g., detecting regions having too many wireless sensors to avoid collision, or finding shopping areas featuring various merchandise or tourist attractions of different styles. Finding regions of interest in a map is a non-trivial problem and retrieving regions of arbitrary shapes poses particular challenges. In this paper, we present a novel region search algorithm, dense region search(DRS), and its extensions, to find regions of interest by estimating the density of locations containing the query keywords in the region. Experiments on both synthetic and real-world datasets demonstrate the effectiveness of our algorithm.We consider the problem of finding map regions that best match query keywords. This region search problem can be applied in many practical scenarios such as shopping recommendation, searching for tourist attractions, and collision region detection for wireless sensor networks. While conventional map search retrieves isolate locations in a map, users frequently attempt to find regions of interest instead, e.g., detecting regions having too many wireless sensors to avoid collision, or finding shopping areas featuring various merchandise or tourist attractions of different styles. Finding regions of interest in a map is a non-trivial problem and retrieving regions of arbitrary shapes poses particular challenges. In this paper, we present a novel region search algorithm, dense region search（DRS）, and its extensions, to find regions of interest by estimating the density of locations containing the query keywords in the region. Experiments on both synthetic and real-world datasets demonstrate the effectiveness of our algorithm.

关 键 词：Map search Region search Region recommendation Spatial keyword search Geographic information system Location-based service 

分 类 号：TP391.3[自动化与计算机技术—计算机应用技术]