Efficient Retrieval of Bounded-Cost Informative Routes

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 r...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on knowledge and data engineering 2017-10, Vol.29 (10), p.2182-2196
Hauptverfasser:	Li, Wengen, Cao, Jiannong, Guan, Jihong, Yiu, Man Lung, Zhou, Shuigeng
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer science Electronic mail Facebook informative route Lungs NP-hard problem Pruning Queries query keywords Road network Roads route query Spatial data Urban areas
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	2196
container_issue	10
container_start_page	2182
container_title	IEEE transactions on knowledge and data engineering
container_volume	29
creator	Li, Wengen Cao, Jiannong Guan, Jihong Yiu, Man Lung Zhou, Shuigeng
description	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.
doi_str_mv	10.1109/TKDE.2017.2721408
format	Article
fullrecord	<record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_2174447830</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7962258</ieee_id><sourcerecordid>2174447830</sourcerecordid><originalsourceid>FETCH-LOGICAL-c293t-ccfe8fd80cc30b447d351102054ea1cf16b3faebcc42ac4718b5b2774bbabfe23</originalsourceid><addsrcrecordid>eNo9kMFKAzEQhoMoWKsPIF4WPG_NJNkme9RatVgQSj2HJDuBLe2mJtmCb--WFk8zh-__Z_gIuQc6AaD10_rzdT5hFOSESQaCqgsygqpSJYMaLoedCigFF_Ka3KS0oZQqqWBEpnPvW9dil4sV5tjiwWyL4IuX0HcNNuUspFwsOh_izuT2gMUq9BnTLbnyZpvw7jzH5Pttvp59lMuv98XseVk6VvNcOudR-UZR5zi1QsiGV8O7jFYCDTgPU8u9QeucYMYJCcpWlkkprDXWI-Nj8njq3cfw02PKehP62A0nNQMphkbF6UDBiXIxpBTR631sdyb-aqD6qEcf9eijHn3WM2QeTpkWEf95WU8ZqxT_A2QPYMQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2174447830</pqid></control><display><type>article</type><title>Efficient Retrieval of Bounded-Cost Informative Routes</title><source>IEEE Electronic Library (IEL)</source><creator>Li, Wengen ; Cao, Jiannong ; Guan, Jihong ; Yiu, Man Lung ; Zhou, Shuigeng</creator><creatorcontrib>Li, Wengen ; Cao, Jiannong ; Guan, Jihong ; Yiu, Man Lung ; Zhou, Shuigeng</creatorcontrib><description>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.</description><identifier>ISSN: 1041-4347</identifier><identifier>EISSN: 1558-2191</identifier><identifier>DOI: 10.1109/TKDE.2017.2721408</identifier><identifier>CODEN: ITKEEH</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Computer science ; Electronic mail ; Facebook ; informative route ; Lungs ; NP-hard problem ; Pruning ; Queries ; query keywords ; Road network ; Roads ; route query ; Spatial data ; Urban areas</subject><ispartof>IEEE transactions on knowledge and data engineering, 2017-10, Vol.29 (10), p.2182-2196</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c293t-ccfe8fd80cc30b447d351102054ea1cf16b3faebcc42ac4718b5b2774bbabfe23</citedby><cites>FETCH-LOGICAL-c293t-ccfe8fd80cc30b447d351102054ea1cf16b3faebcc42ac4718b5b2774bbabfe23</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7962258$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7962258$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Li, Wengen</creatorcontrib><creatorcontrib>Cao, Jiannong</creatorcontrib><creatorcontrib>Guan, Jihong</creatorcontrib><creatorcontrib>Yiu, Man Lung</creatorcontrib><creatorcontrib>Zhou, Shuigeng</creatorcontrib><title>Efficient Retrieval of Bounded-Cost Informative Routes</title><title>IEEE transactions on knowledge and data engineering</title><addtitle>TKDE</addtitle><description>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.</description><subject>Computer science</subject><subject>Electronic mail</subject><subject>Facebook</subject><subject>informative route</subject><subject>Lungs</subject><subject>NP-hard problem</subject><subject>Pruning</subject><subject>Queries</subject><subject>query keywords</subject><subject>Road network</subject><subject>Roads</subject><subject>route query</subject><subject>Spatial data</subject><subject>Urban areas</subject><issn>1041-4347</issn><issn>1558-2191</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kMFKAzEQhoMoWKsPIF4WPG_NJNkme9RatVgQSj2HJDuBLe2mJtmCb--WFk8zh-__Z_gIuQc6AaD10_rzdT5hFOSESQaCqgsygqpSJYMaLoedCigFF_Ka3KS0oZQqqWBEpnPvW9dil4sV5tjiwWyL4IuX0HcNNuUspFwsOh_izuT2gMUq9BnTLbnyZpvw7jzH5Pttvp59lMuv98XseVk6VvNcOudR-UZR5zi1QsiGV8O7jFYCDTgPU8u9QeucYMYJCcpWlkkprDXWI-Nj8njq3cfw02PKehP62A0nNQMphkbF6UDBiXIxpBTR631sdyb-aqD6qEcf9eijHn3WM2QeTpkWEf95WU8ZqxT_A2QPYMQ</recordid><startdate>20171001</startdate><enddate>20171001</enddate><creator>Li, Wengen</creator><creator>Cao, Jiannong</creator><creator>Guan, Jihong</creator><creator>Yiu, Man Lung</creator><creator>Zhou, Shuigeng</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20171001</creationdate><title>Efficient Retrieval of Bounded-Cost Informative Routes</title><author>Li, Wengen ; Cao, Jiannong ; Guan, Jihong ; Yiu, Man Lung ; Zhou, Shuigeng</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c293t-ccfe8fd80cc30b447d351102054ea1cf16b3faebcc42ac4718b5b2774bbabfe23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Computer science</topic><topic>Electronic mail</topic><topic>Facebook</topic><topic>informative route</topic><topic>Lungs</topic><topic>NP-hard problem</topic><topic>Pruning</topic><topic>Queries</topic><topic>query keywords</topic><topic>Road network</topic><topic>Roads</topic><topic>route query</topic><topic>Spatial data</topic><topic>Urban areas</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Li, Wengen</creatorcontrib><creatorcontrib>Cao, Jiannong</creatorcontrib><creatorcontrib>Guan, Jihong</creatorcontrib><creatorcontrib>Yiu, Man Lung</creatorcontrib><creatorcontrib>Zhou, Shuigeng</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on knowledge and data engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Li, Wengen</au><au>Cao, Jiannong</au><au>Guan, Jihong</au><au>Yiu, Man Lung</au><au>Zhou, Shuigeng</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Efficient Retrieval of Bounded-Cost Informative Routes</atitle><jtitle>IEEE transactions on knowledge and data engineering</jtitle><stitle>TKDE</stitle><date>2017-10-01</date><risdate>2017</risdate><volume>29</volume><issue>10</issue><spage>2182</spage><epage>2196</epage><pages>2182-2196</pages><issn>1041-4347</issn><eissn>1558-2191</eissn><coden>ITKEEH</coden><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.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TKDE.2017.2721408</doi><tpages>15</tpages></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISSN: 1041-4347
ispartof	IEEE transactions on knowledge and data engineering, 2017-10, Vol.29 (10), p.2182-2196
issn	1041-4347 1558-2191
language	eng
recordid	cdi_proquest_journals_2174447830
source	IEEE Electronic Library (IEL)
subjects	Computer science Electronic mail Facebook informative route Lungs NP-hard problem Pruning Queries query keywords Road network Roads route query Spatial data Urban areas
title	Efficient Retrieval of Bounded-Cost Informative Routes
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T14%3A32%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Efficient%20Retrieval%20of%20Bounded-Cost%20Informative%20Routes&rft.jtitle=IEEE%20transactions%20on%20knowledge%20and%20data%20engineering&rft.au=Li,%20Wengen&rft.date=2017-10-01&rft.volume=29&rft.issue=10&rft.spage=2182&rft.epage=2196&rft.pages=2182-2196&rft.issn=1041-4347&rft.eissn=1558-2191&rft.coden=ITKEEH&rft_id=info:doi/10.1109/TKDE.2017.2721408&rft_dat=%3Cproquest_RIE%3E2174447830%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2174447830&rft_id=info:pmid/&rft_ieee_id=7962258&rfr_iscdi=true