Efficient Retrieval of Bounded-Cost Informative Routes
Lists
Only you see this
Abstract
The widespread location-aware applications produce a vast amount of spatio-textual data that contains both spatial and textual attributes. To make use of this enriched information for users to describe their preferences for travel routes, we propose a Bounded-Cost Informative Route (BCIR) query to retrieve the routes that are the most textually relevant to the user-specified query keywords subject to a travel cost constraint. BCIR query is particularly helpful for tourists and city explorers to plan their travel routes. We will show that BCIR query is an NP-hard problem. To answer BCIR query efficiently, we propose an exact solution with effective pruning techniques and two approximate solutions with performance guarantees. Extensive experiments over real data sets demonstrate that the proposed solutions achieve the expected performance.
BibTeX
@inproceedings{li2018efficient,
author = {Wengen Li and Jiannong Cao and Jihong Guan and Man Lung Yiu and Shuigeng Zhou},
title = {{Efficient Retrieval of Bounded-Cost Informative Routes}},
booktitle = {ICDE},
year = {2018},
doi = {10.1109/icde.2018.00263},
}Loading related content...