User oriented trajectory search for trip recommendation

Handle URI:
http://hdl.handle.net/10754/564490
Title:
User oriented trajectory search for trip recommendation
Authors:
Shang, Shuo; Ding, Ruogu; Yuan, Bo; Xie, Kexin; Zheng, Kai; Kalnis, Panos ( 0000-0002-5060-1360 )
Abstract:
Trajectory sharing and searching have received significant attentions in recent years. In this paper, we propose and investigate a novel problem called User Oriented Trajectory Search (UOTS) for trip recommendation. In contrast to conventional trajectory search by locations (spatial domain only), we consider both spatial and textual domains in the new UOTS query. Given a trajectory data set, the query input contains a set of intended places given by the traveler and a set of textual attributes describing the traveler's preference. If a trajectory is connecting/close to the specified query locations, and the textual attributes of the trajectory are similar to the traveler'e preference, it will be recommended to the traveler for reference. This type of queries can bring significant benefits to travelers in many popular applications such as trip planning and recommendation. There are two challenges in the UOTS problem, (i) how to constrain the searching range in two domains and (ii) how to schedule multiple query sources effectively. To overcome the challenges and answer the UOTS query efficiently, a novel collaborative searching approach is developed. Conceptually, the UOTS query processing is conducted in the spatial and textual domains alternately. A pair of upper and lower bounds are devised to constrain the searching range in two domains. In the meantime, a heuristic searching strategy based on priority ranking is adopted for scheduling the multiple query sources, which can further reduce the searching range and enhance the query efficiency notably. Furthermore, the devised collaborative searching approach can be extended to situations where the query locations are ordered. The performance of the proposed UOTS query is verified by extensive experiments based on real and synthetic trajectory data in road networks. © 2012 ACM.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Computer Science Program
Publisher:
Association for Computing Machinery (ACM)
Journal:
Proceedings of the 15th International Conference on Extending Database Technology - EDBT '12
Conference/Event name:
15th International Conference on Extending Database Technology, EDBT 2012
Issue Date:
2012
DOI:
10.1145/2247596.2247616
Type:
Conference Paper
ISBN:
9781450307901
Appears in Collections:
Conference Papers; Computer Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorShang, Shuoen
dc.contributor.authorDing, Ruoguen
dc.contributor.authorYuan, Boen
dc.contributor.authorXie, Kexinen
dc.contributor.authorZheng, Kaien
dc.contributor.authorKalnis, Panosen
dc.date.accessioned2015-08-04T07:02:19Zen
dc.date.available2015-08-04T07:02:19Zen
dc.date.issued2012en
dc.identifier.isbn9781450307901en
dc.identifier.doi10.1145/2247596.2247616en
dc.identifier.urihttp://hdl.handle.net/10754/564490en
dc.description.abstractTrajectory sharing and searching have received significant attentions in recent years. In this paper, we propose and investigate a novel problem called User Oriented Trajectory Search (UOTS) for trip recommendation. In contrast to conventional trajectory search by locations (spatial domain only), we consider both spatial and textual domains in the new UOTS query. Given a trajectory data set, the query input contains a set of intended places given by the traveler and a set of textual attributes describing the traveler's preference. If a trajectory is connecting/close to the specified query locations, and the textual attributes of the trajectory are similar to the traveler'e preference, it will be recommended to the traveler for reference. This type of queries can bring significant benefits to travelers in many popular applications such as trip planning and recommendation. There are two challenges in the UOTS problem, (i) how to constrain the searching range in two domains and (ii) how to schedule multiple query sources effectively. To overcome the challenges and answer the UOTS query efficiently, a novel collaborative searching approach is developed. Conceptually, the UOTS query processing is conducted in the spatial and textual domains alternately. A pair of upper and lower bounds are devised to constrain the searching range in two domains. In the meantime, a heuristic searching strategy based on priority ranking is adopted for scheduling the multiple query sources, which can further reduce the searching range and enhance the query efficiency notably. Furthermore, the devised collaborative searching approach can be extended to situations where the query locations are ordered. The performance of the proposed UOTS query is verified by extensive experiments based on real and synthetic trajectory data in road networks. © 2012 ACM.en
dc.publisherAssociation for Computing Machinery (ACM)en
dc.subjectefficiencyen
dc.subjectlocationsen
dc.subjectroad networksen
dc.subjecttrip recommendationen
dc.subjectuser oriented trajectory searchen
dc.titleUser oriented trajectory search for trip recommendationen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentComputer Science Programen
dc.identifier.journalProceedings of the 15th International Conference on Extending Database Technology - EDBT '12en
dc.conference.date27 March 2012 through 30 March 2012en
dc.conference.name15th International Conference on Extending Database Technology, EDBT 2012en
dc.conference.locationBerlinen
dc.contributor.institutionSchool of Information Technology and Electrical Engineering, University of Queensland, Australiaen
dc.contributor.institutionDivision of Informatics, Graduate School at Shenzhen, Tsinghua University, Chinaen
kaust.authorDing, Ruoguen
kaust.authorKalnis, Panosen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.