Finding time period-based most frequent path in big trajectory data

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2013, Pages 713-724

  Luo, Wuman ^a   Tan, Haoyu ^a   Chen, Lei ^a   Ni, Lionel M ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Big trajectory data; Path finding

Indexed keywords

COMMON SENSE; FIXED TIME; PATH FINDING; SEARCH ALGORITHMS; SPEED UP; TIME-PERIODS; TRAJECTORY DATA;

MOBILE DEVICES;

TRAJECTORIES;

EID: 84880562062     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2463676.2465287     Document Type: Conference Paper

References (33)

1. R. Bellman. On a routing problem. Quarterly of Applied Mathematics, 16:87-90, 1958.
2. V. P. Chakka, A. Everspaugh, and J. M. Patel. Indexing large trajectory data sets with seti. In CIDR, 2003.
3. Z. Chen, H. T. Shen, and X. Zhou. Discovering popular routes from trajectories. In ICDE, pages 900-911, 2011.
4. 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.
5. *. Geoinformatica, 9(1):33-60, 2005.
6. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische mathematik, 1(1):269-271, 1959.
7. B. Ding, J. X. Yu, and L. Qin. Finding time-dependent shortest paths over large graphs. In EDBT, pages 205-216, 2008.
8. E. Frentzos. Indexing objects moving on fixed networks. In SSTD, pages 289-305, 2003.
9. S. Gaffney and P. Smyth. Trajectory clustering with mixtures of regression models. In SIGKDD, pages 63-72, 1999.
10. F. Giannotti, M. Nanni, F. Pinelli, and D. Pedreschi. Trajectory pattern mining. In SIGKDD, pages 330-339, 2007.
11. 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.
12. A. Guttman. R-trees: a dynamic index structure for spatial searching. In SIGMOD, pages 47-57, 1984.
13. E. Kanoulas, Y. Du, T. Xia, and D. Zhang. Finding fastest paths on a road network with speed patterns. In ICDE, pages 10-, 2006.
14. 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.
15. J.-G. Lee, J. Han, and K.-Y. Whang. Trajectory clustering: a partition-and-group framework. In SIGMOD, pages 593-604, 2007.
16. 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.
17. 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.
18. 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.
19. 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.
20. M. A. Nascimento and J. R. O. Silva. Towards historical r-trees. In SAC, pages 235-240, 1998.
21. 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.
22. S. Pallottino and M. G. Scutella. Shortest path algorithms in transportation models: classical and innovative aspects. Equilibrium and advanced transportation modelling, 245:281, 1998.
23. D. Pfoser, C. S. Jensen, and Y. Theodoridis. Novel approaches in query processing for moving object trajectories. In VLDB, pages 395-406, 2000.
24. 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.
25. Y. Tao and D. Papadias. Mv3r-tree: A spatio-temporal access method for timestamp and interval queries. In VLDB, pages 431-440, 2001.
26. Y. Theodoridis, M. Vazirgiannis, and T. Sellis. Spatio-temporal indexing for large multimedia applications. In ICMCS, pages 441-448, 1996.
27. L.-Y. Wei, Y. Zheng, and W.-C. Peng. Constructing popular routes from uncertain trajectories. In ACM SIGKDD, pages 195-203, 2012.
28. X. Xu, J. Han, and W. Lu. Rt-tree: An improved r-tree index structure for spatiotemporal. SDH, pages 1040-1049, 1990.
29. J. Yuan, Y. Zheng, X. Xie, and G. Sun. Driving with knowledge from the physical world. In SIGKDD, pages 316-324, 2011.
30. 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.
31. J. Yuan, Y. Zheng, L. Zhang, X. Xie, and G. Sun. Where to find my next passenger. In UbiComp, pages 109-118, 2011.
32. Y. Zheng, Y. Liu, J. Yuan, and X. Xie. Urban computing with taxicabs. In UbiComp, pages 89-98, 2011.
33. 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. Cooperation Program