Show simple item record

dc.contributor.authorShang, Shuo
dc.contributor.authorDing, Ruogu
dc.contributor.authorYuan, Bo
dc.contributor.authorXie, Kexin
dc.contributor.authorZheng, Kai
dc.contributor.authorKalnis, Panos
dc.date.accessioned2015-08-04T07:02:19Z
dc.date.available2015-08-04T07:02:19Z
dc.date.issued2012
dc.identifier.isbn9781450307901
dc.identifier.doi10.1145/2247596.2247616
dc.identifier.urihttp://hdl.handle.net/10754/564490
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.
dc.publisherAssociation for Computing Machinery (ACM)
dc.subjectefficiency
dc.subjectlocations
dc.subjectroad networks
dc.subjecttrip recommendation
dc.subjectuser oriented trajectory search
dc.titleUser oriented trajectory search for trip recommendation
dc.typeConference Paper
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentComputer Science Program
dc.identifier.journalProceedings of the 15th International Conference on Extending Database Technology - EDBT '12
dc.conference.date27 March 2012 through 30 March 2012
dc.conference.name15th International Conference on Extending Database Technology, EDBT 2012
dc.conference.locationBerlin
dc.contributor.institutionSchool of Information Technology and Electrical Engineering, University of Queensland, Australia
dc.contributor.institutionDivision of Informatics, Graduate School at Shenzhen, Tsinghua University, China
kaust.personDing, Ruogu
kaust.personKalnis, Panos


This item appears in the following Collection(s)

Show simple item record