PATS: A framework of pattern-aware trajectory search

Ling Yin Wei*, Wen-Chih Peng, Bo Chong Chen, Ting Wei Lin

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

16 Scopus citations

Abstract

In this paper, we develop a framework of trajectory search, called pattern-aware trajectory search (abbreviated as PATS). Given a set of trajectories, potential regions are extracted first and potential regions are viewed as popular regions interested by users. Furthermore, potential regions are organized as a region transition graph, where each vertex is a potential region and edges capture sequential travels of potential regions from a set of trajectories given. By exploring the concept of random walk, the attractiveness of a potential region is derived. In light of attractiveness of potential regions, the attractiveness of a trajectory is formulated and PATS will return top-K trajectories according to their attractiveness. We evaluated our framework by a real GPS dataset. Experimental results show that PATS is able to retrieve trajectories interested by users.

Original languageEnglish
Title of host publicationMDM2010 - 11th International Conference on Mobile Data Management
Pages372-377
Number of pages6
DOIs
StatePublished - 9 Aug 2010
Event11th IEEE International Conference on Mobile Data Management, MDM 2010 - Kansas City, MO, United States
Duration: 23 May 201026 May 2010

Publication series

NameProceedings - IEEE International Conference on Mobile Data Management
ISSN (Print)1551-6245

Conference

Conference11th IEEE International Conference on Mobile Data Management, MDM 2010
CountryUnited States
CityKansas City, MO
Period23/05/1026/05/10

Fingerprint Dive into the research topics of 'PATS: A framework of pattern-aware trajectory search'. Together they form a unique fingerprint.

Cite this