skip to main content
research-article

A framework of traveling companion discovery on trajectory data streams

Published:03 January 2014Publication History
Skip Abstract Section

Abstract

The advance of mobile technologies leads to huge volumes of spatio-temporal data collected in the form of trajectory data streams. In this study, we investigate the problem of discovering object groups that travel together (i.e., traveling companions) from trajectory data streams. Such technique has broad applications in the areas of scientific study, transportation management, and military surveillance. To discover traveling companions, the monitoring system should cluster the objects of each snapshot and intersect the clustering results to retrieve moving-together objects. Since both clustering and intersection steps involve high computational overhead, the key issue of companion discovery is to improve the efficiency of algorithms. We propose the models of closed companion candidates and smart intersection to accelerate data processing. A data structure termed traveling buddy is designed to facilitate scalable and flexible companion discovery from trajectory streams. The traveling buddies are microgroups of objects that are tightly bound together. By only storing the object relationships rather than their spatial coordinates, the buddies can be dynamically maintained along the trajectory stream with low cost. Based on traveling buddies, the system can discover companions without accessing the object details. In addition, we extend the proposed framework to discover companions on more complicated scenarios with spatial and temporal constraints, such as on the road network and battlefield. The proposed methods are evaluated with extensive experiments on both real and synthetic datasets. Experimental results show that our proposed buddy-based approach is an order of magnitude faster than the baselines and achieves higher accuracy in companion discovery.

References

  1. Aung, H.-H. 2008. Discovering moving groups of tagged objects. Tech. rep., National University of Singapore. http://www.nus.edu.sg/.Google ScholarGoogle Scholar
  2. Bakalov, P., Hadjieleftheriou, M., and Tsotras, V. J. 2005. Time relaxed spatiotemporal trajectory joins. In Proceedings of the 13th Annual ACM International Workshop on Geographic Information Systems (GIS'05). 182--191. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Benkert, M., Guddmundsson, J., Hubner, F., and Wolle, T. 2008. Reporting flock patterns. Comput. Geom. Theory Appl. 41, 3, 111--125. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Cadez, I. V., Gaffney, S., and Smyth, P. 2000. A general probabilistic framework for clustering individuals and objects. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'00). 140--149. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Ester, M., Kriegel, H.-P., Sander, J.,Wimmer, M., and Xu, X. 1998. Incremental clustering for mining in a data warehousing environment. In Proceedings of the 24th International Conference on Very Large Data Bases (VLDB'98). 323--333. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Ester, M., Kriegel, H.-P., Sander, J., and Xu, X. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD'96). 226--231.Google ScholarGoogle Scholar
  7. Gaffney, S. and Smyth, P. 1999. Trajectory clustering with mixtures of regression models. In Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'99). 63--72 Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Giannotti, F., Nanni, M., Pedreschi, D., and Pinelli, F. 2007. Trajectory pattern mining. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'07). 330--339. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Gonzalez, T. 1985. Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293--306.Google ScholarGoogle ScholarCross RefCross Ref
  10. Gudmundsson, J. and Kreveld, M. V. 2006. Computing longest duration flocks in trajectory data. In Proceedings of the 14th Annual ACM International Symposium on Advances in Geographic Information Systems (GIS'06). 35--42. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Gudmundsson, J., Kreveld, M. V., and Speckmann, B. 2004. Efficient detection of motion patterns in spatio-temporal data sets. In Proceedings of the 12th Annual ACM International Workshop on Geographic Information Systems (GIS'04). 250--257. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Gunopoulos, D. 2002. Discovering similar multidimensional trajectories. In Proceedings of the 18th International Conference on Data Engineering (ICDE'02). 673--684. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Han, J. and Kamber, M. 2006. Data Mining: Concepts and Techniques 2nd Ed. Morgan Kaufmann. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Har-Peled, S. 2003. Clustering motion. Discr. Comput. Geom. 31, 4, 545--565. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Horvitz, E., Apacible, J., Sarin, R., and Liao, L. 2005. Prediction, expectation, and surprise: Methods, designs, and study of a deployed traffic forecasting service. In Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence (UAI'05).Google ScholarGoogle Scholar
  16. Jensen, C. S., Lin, D., and Ooi, B. C. 2007. Continuous clustering of moving objects. IEEE Trans. Knowl. Data Engin. 19, 9, 1161--1174. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Jeung, H., Yiu, M. L., Zhou, X., Jensen, C. S., and Shen, H. T. 2008. Discovery of convoys in trajectory databases. Proc. VLDB Endow. 1, 1, 1068--1080. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Kalnis, P., Mamoulis, N., and Bakiras, S. 2005. On discovering moving clusters in spatial-temporal data. In Proceedings of the 9th International Conference on Advances in Spatial and Temporal Databases (SSTD'05). 364--381. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Krout, T. 2007. Cb manet scenario data distribution. Tech. rep., BBN.Google ScholarGoogle Scholar
  20. Lee, J.-G., Han, J., and Whang, K.-Y. 2007. Trajectory clustering: A partition-and-group framework. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'07). 593--604. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Lee, M., Hsu, W., Jensen, C. S., Cui, B., and Teo, K. 2003. Supporting frequent updates in r-trees: A bottom-up approach. The VLDB J. 18, 3, 719--738. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Li, X., Han, J., Lee, J.-G., and Gonzalez, H. 2007. Traffic density based discovery of hot routes in road networks. In Proceedings of the 10th International Conference on Advances in Spatial and Temporal Databases (SSTD'07). 441--459. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Li, Y., Han, J., and Yang, J. 2004. Clustering moving objects. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'04). 617--622. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Li, Z., Ding, B., Han, J., and Kays, R. 2010. Swarm: Mining relaxed temporal moving object clusters accurate discovery of valid convoys from moving object trajectories. Proc. VLDB Endow. 3, 723--734. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Liu, L. and Wong, R. C.-W. 2011. Finding shortest path on land surface. In Proceedings of the ACM SIGMOD International Conference on Management of data (SIGMOD'11). 433--444. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Liu, Y., Chen, L., Pei, J., Chen, Q., and Zhao, Y. 2007. Mining frequent trajectory patterns for activity monitoring using radio frequency tag arrays. In Proceedings of the 5th IEEE International Conference on Pervasive Computing and Communications (PerCom'07). Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Nutanong, S., Zhang, R., Tanin, E., and Kulik, L. 2008. The v*-diagram: A query dependent approach to moving knn queries. Proc. VLDB Endow. 1, 1, 1095--1106. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Nutanong, S., Zhang, R., Tanin, E., and Kulik, L. 2010. Analysis and evaluation of v*-knn: An efficient algorithm for moving knn queries. VLDB J. 19, 3, 307--332. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Pearl, J. 1984. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Longman Publishing Co. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Shahabi, C., Tang, L. A., and Xing, S. 2008. Indexing land surface for efficient knn query. Proc. VLDB Endow. 1, 1, 1020--1031. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Tang, L.-A., Yu, X., Kim, S., Han, J., Hung, C.-C., and Peng, W.-C. 2010. Tru-alarm: Trustworthiness analysis of sensor networks in cyber-physical systems. In Proceedings of the IEEE International Conference on Data Mining (ICDM'10). 1079--1084. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Tang, L.-A., Zheng, Y., Xie, X., Yuan, J., Yu, X., and Han, J. 2011. Retrieving k-nearest neighboring trajectories by a set of point locations. In Proceedings of the 12th International Conference on Advances in Spatial and Temporal Databases (SSTD'11). 223--241. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Tang, L.-A., Zheng, Y., Yuan, J., Han, J., Leung, A., Hung, C.-C., and Peng, W.-C. 2012. On discovery of traveling companions from streaming trajectories. In Proceedings of the 28th IEEE International Conference on Data Engineering (ICDE'12). 186--197. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Tao, Y., Kollios, G., Considine, J., Li, F., and Papadias, D. 2004. Spatio-temporal aggregation using sketches. In Proceedings of the 20th IEEE International Conference on Data Engineering (ICDE'04). 214. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Tao, Y., Sheng, C., and Pei, J. 2011. On k-skip shortest paths. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'11). 421--432. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Xing, S. and Shahabi, C. 2010. Scalable shortest paths browsing on land surface. In Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS'10). 89--98. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Xing, S., Shahabi, C., and Pan, B. 2009. Continuous monitoring of nearest neighbors on land surface. Proc. VLDB Endow. 2, 1, 1114--1125. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Yang, D., Rundensteiner, E. A., and Ward, M. O. 2009. Neighbor-based pattern detection for windows over streaming data. In Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (EDBT'09). 529--540. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Yi, B., Jagadish, H. V., and Faloutsos, C. 1998. Efficient retrieval of similar time sequences under time warping. In Proceedings of the 14th International Conference on Data Engineering (ICDE'98). 201--208. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. Yoo, J. S. and Shekhar, S. 2004. A partial join approach for mining co-location patterns. In Proceedings of the 12th Annual ACM International Workshop on Geographic Information Systems (GIS'04). 241--249. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. Yuan, J., Zheng, Y., Xie, X., and Sun, G. 2011. Driving with knowledge from the physical world. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'11). 316--324. Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. Yuan, J., Zheng, Y., Zhang, C., Xie, W., Xie, X., Sun, G., and Huang, Y. 2010. T-drive: Driving directions based on taxi trajectories. In Proceedings of the 18th SIGSPATIAL International Conference on Advances on Geographical Information Systems (GIS'10). 99--108. Google ScholarGoogle ScholarDigital LibraryDigital Library
  43. Zhang, Q. and Lin, X. 2004. Clustering moving objects for spatial-temporal selectivity estimation. In Proceedings of the 15th Australasian Database Conference (ADC'04). 123--130. Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. Zhang, R., Lin, D., Ramamohanarao, K., and Bertino, E. 2008. Continuous intersection joins over moving objects. In Proceedings of the 24th International Conference on Data Engineering (ICDE'08). 863--872. Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. Zhang, R., Qi, J., Lin, D., Wang, W., and Wong, R. C.-W. 2011. A highly optimized algorithm for continuous intersection join queries over moving objects. VLDB J. 21, 4, 561--586. Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. Zheng, K., Zheng, Y., Xie, X., and Zhou, X. 2012. Reducing uncertainty of low-sampling-rate trajectories. In Proceedings of the 28th IEEE International Conference on Data Engineering (ICDE'12). 1144--1155. Google ScholarGoogle ScholarDigital LibraryDigital Library
  47. Zheng, Y., Xie, X., and Ma, W. 2010. GeoLife: A collaborative social networking service among user, location and trajectory. IEEE Data Engin. Bull. 33, 2, 32--40.Google ScholarGoogle Scholar
  48. Zheng, Y. and Zhou, X. 2011. Computing with Spatial Trajectories. Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  49. Zhu, F., Yan, X., Han, J., Yu, P. S., and Cheng, H. 2007. Mining colossal frequent patterns by core pattern fusion. In Proceedings of the 23rd International Conference on Data Engineering (ICDE'07). 706--715.Google ScholarGoogle Scholar

Index Terms

  1. A framework of traveling companion discovery on trajectory data streams

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Intelligent Systems and Technology
      ACM Transactions on Intelligent Systems and Technology  Volume 5, Issue 1
      Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web Mining
      December 2013
      520 pages
      ISSN:2157-6904
      EISSN:2157-6912
      DOI:10.1145/2542182
      Issue’s Table of Contents

      Copyright © 2014 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 3 January 2014
      • Accepted: 1 May 2012
      • Revised: 1 March 2012
      • Received: 1 February 2012
      Published in tist Volume 5, Issue 1

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader