Efficient retrieval of bounded-cost informative routes

Wengen Li, Jiannong Cao, Jihong Guan, Man Lung Yiu, Shuigeng Zhou

Research output: Journal article publicationJournal articleAcademic researchpeer-review

13 Citations (Scopus)


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.
Original languageEnglish
Article number7962258
Pages (from-to)2182-2196
Number of pages15
JournalIEEE Transactions on Knowledge and Data Engineering
Issue number10
Publication statusPublished - 1 Oct 2017


  • Informative route
  • Query keywords
  • Road network
  • Route query

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics


Dive into the research topics of 'Efficient retrieval of bounded-cost informative routes'. Together they form a unique fingerprint.

Cite this