Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/36396
Title: Retrieving regions of interest for user exploration
Authors: Cao, X
Cong, G
Jensen, CS
Yiu, ML 
Issue Date: 2014
Publisher: Association for Computing Machinery
Source: Proceedings of the VLDB Endowment, 2014, v. 7, no. 9, p. 733-744 How to cite?
Journal: Proceedings of the VLDB Endowment 
Abstract: We consider an application scenario where points of interest (PoIs) each have a web presence and where a web user wants to iden- tify a region that contains relevant PoIs that are relevant to a set of keywords, e.g., in preparation for deciding where to go to conve- niently explore the PoIs. Motivated by this, we propose the length- constrained maximum-sum region (LCMSR) query that returns a spatial-network region that is located within a general region of in- terest, that does not exceed a given size constraint, and that best matches query keywords. Such a query maximizes the total weight of the PoIs in it w.r.t. the query keywords. We show that it is NP- hard to answer this query. We develop an approximation algorithm with a (5 + ?) approximation ratio utilizing a technique that scales node weights into integers. We also propose a more efficient heuris- tic algorithm and a greedy algorithm. Empirical studies on real data offer detailed insight into the accuracy of the proposed algorithms and show that the proposed algorithms are capable of computing results efficiently and effectively.
URI: http://hdl.handle.net/10397/36396
ISSN: 2150-8097
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

193
Last Week
3
Last month
Checked on Jun 25, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.