Wuman Luo
Lei Chen
ABSTRACT
The rise of GPS-equipped mobile devices has led to the emergence of big trajectory data. In this paper, we study a new path finding query which finds the most frequent path (MFP) during user-specified time periods in large-scale historical trajectory data. We refer to this query as time period-based MFP (TPMFP). Specifically, given a time period T, a source v_s and a destination v_d, TPMFP searches the MFP from v_s to v_d during T. Though there exist several proposals on defining MFP, they only consider a fixed time period. Most importantly, we find that none of them can well reflect people's common sense notion which can be described by three key properties, namely suffix-optimal (i.e., any suffix of an MFP is also an MFP), length-insensitive (i.e., MFP should not favor shorter or longer paths), and bottleneck-free (i.e., MFP should not contain infrequent edges). The TPMFP with the above properties will reveal not only common routing preferences of the past travelers, but also take the time effectiveness into consideration. Therefore, our first task is to give a TPMFP definition that satisfies the above three properties. Then, given the comprehensive TPMFP definition, our next task is to find TPMFP over huge amount of trajectory data efficiently. Particularly, we propose efficient search algorithms together with novel indexes to speed up the processing of TPMFP. To demonstrate both the effectiveness and the efficiency of our approach, we conduct extensive experiments using a real dataset containing over 11 million trajectories.
- R. Bellman. On a routing problem. Quarterly of Applied Mathematics, 16:87--90, 1958.Google Scholar
Cross Ref
- V. P. Chakka, A. Everspaugh, and J. M. Patel. Indexing large trajectory data sets with seti. In CIDR, 2003.Google Scholar
- Z. Chen, H. T. Shen, and X. Zhou. Discovering popular routes from trajectories. In ICDE, pages 900--911, 2011. Google ScholarDigital Library
- P. Cudré-Mauroux, E. Wu, and S. Madden. Trajstore: An adaptive storage system for very large trajectory data sets. In ICDE, pages 109--120, 2010.Google ScholarCross Ref
- V. T. De Almeida and R. H. Güting. Indexing the trajectories of moving objects in networks*. Geoinformatica, 9(1):33--60, 2005. Google ScholarDigital Library
- E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische mathematik, 1(1):269--271, 1959.Google ScholarDigital Library
- B. Ding, J. X. Yu, and L. Qin. Finding time-dependent shortest paths over large graphs. In EDBT, pages 205--216, 2008. Google ScholarDigital Library
- E. Frentzos. Indexing objects moving on fixed networks. In SSTD, pages 289--305, 2003.Google ScholarCross Ref
- S. Gaffney and P. Smyth. Trajectory clustering with mixtures of regression models. In SIGKDD, pages 63--72, 1999. Google ScholarDigital Library
- F. Giannotti, M. Nanni, F. Pinelli, and D. Pedreschi. Trajectory pattern mining. In SIGKDD, pages 330--339, 2007. Google ScholarDigital Library
- H. Gonzalez, J. Han, X. Li, M. Myslinska, and J. P. Sondag. Adaptive fastest path computation on a road network: a traffic mining approach. In VLDB, pages 794--805, 2007. Google ScholarDigital Library
- A. Guttman. R-trees: a dynamic index structure for spatial searching. In SIGMOD, pages 47--57, 1984. Google ScholarDigital Library
- E. Kanoulas, Y. Du, T. Xia, and D. Zhang. Finding fastest paths on a road network with speed patterns. In ICDE, pages 10--, 2006. Google ScholarDigital Library
- J.-G. Lee, J. Han, X. Li, and H. Gonzalez. Traclass: trajectory classification using hierarchical region-based and trajectory-based clustering. PVLDB, 1(1):1081--1094, 2008. Google ScholarDigital Library
- J.-G. Lee, J. Han, and K.-Y. Whang. Trajectory clustering: a partition-and-group framework. In SIGMOD, pages 593--604, 2007. Google ScholarDigital Library
- X. Li, J. Han, J.-G. Lee, and H. Gonzalez. Traffic density-based discovery of hot routes in road networks. In SSTD, pages 441--459, 2007. Google ScholarDigital Library
- Z. Li, B. Ding, J. Han, and R. Kays. Swarm: mining relaxed temporal moving object clusters. Proc. VLDB Endow., 3(1-2):723--734, 2010. Google ScholarDigital Library
- Y. Lou, C. Zhang, Y. Zheng, X. Xie, W. Wang, and Y. Huang. Map-matching for low-sampling-rate gps trajectories. In ACM SIGSPATIAL GIS, pages 352--361, 2009. Google ScholarDigital Library
- N. Mamoulis, H. Cao, G. Kollios, M. Hadjieleftheriou, Y. Tao, and D. W. Cheung. Mining, indexing, and querying historical spatiotemporal data. In SIGKDD, pages 236--245, 2004. Google ScholarDigital Library
- M. A. Nascimento and J. R. O. Silva. Towards historical r-trees. In SAC, pages 235--240, 1998. Google ScholarDigital Library
- A. Orda and R. Rom. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM, 37(3):607--625, 1990. Google ScholarDigital Library
- S. Pallottino and M. G. Scutella. Shortest path algorithms in transportation models: classical and innovative aspects. Equilibrium and advanced transportation modelling, 245:281, 1998.Google Scholar
- D. Pfoser, C. S. Jensen, and Y. Theodoridis. Novel approaches in query processing for moving object trajectories. In VLDB, pages 395--406, 2000. Google ScholarDigital Library
- D. Sacharidis, K. Patroumpas, M. Terrovitis, V. Kantere, M. Potamias, K. Mouratidis, and T. Sellis. On-line discovery of hot motion paths. In EDBT, pages 392--403, 2008. Google ScholarDigital Library
- Y. Tao and D. Papadias. Mv3r-tree: A spatio-temporal access method for timestamp and interval queries. In VLDB, pages 431--440, 2001. Google ScholarDigital Library
- Y. Theodoridis, M. Vazirgiannis, and T. Sellis. Spatio-temporal indexing for large multimedia applications. In ICMCS, pages 441--448, 1996. Google ScholarDigital Library
- L.-Y. Wei, Y. Zheng, and W.-C. Peng. Constructing popular routes from uncertain trajectories. In ACM SIGKDD, pages 195--203, 2012. Google ScholarDigital Library
- X. Xu, J. Han, and W. Lu. Rt-tree: An improved r-tree index structure for spatiotemporal. SDH, pages 1040--1049, 1990.Google Scholar
- J. Yuan, Y. Zheng, X. Xie, and G. Sun. Driving with knowledge from the physical world. In SIGKDD, pages 316--324, 2011. Google ScholarDigital Library
- J. Yuan, Y. Zheng, C. Zhang, W. Xie, X. Xie, G. Sun, and Y. Huang. T-drive: driving directions based on taxi trajectories. In SIGSPATIAL GIS, pages 99--108, 2010. Google ScholarDigital Library
- J. Yuan, Y. Zheng, L. Zhang, X. Xie, and G. Sun. Where to find my next passenger. In UbiComp, pages 109--118, 2011. Google ScholarDigital Library
- Y. Zheng, Y. Liu, J. Yuan, and X. Xie. Urban computing with taxicabs. In UbiComp, pages 89--98, 2011. Google ScholarDigital Library
- Y. Zheng, L. Zhang, X. Xie, and W.-Y. Ma. Mining interesting locations and travel sequences from gps trajectories. In WWW, pages 791--800, 2009. Google ScholarDigital Library
Index Terms
- Finding time period-based most frequent path in big trajectory data
Recommendations
Path-based queries on trajectory data
SIGSPATIAL '14: Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information SystemsIn traffic research, management, and planning a number of path-based analyses are heavily used, e.g., for computing turn-times, evaluating green waves, or studying traffic flow. These analyses require retrieving the trajectories that follow the full ...
Finding efficiencies in frequent pattern mining from big uncertain data
Many existing data mining algorithms search interesting patterns from transactional databases of precise data. However, there are situations in which data are uncertain. Items in each transaction of these probabilistic databases of uncertain data are ...
Comments