skip to main content
10.1145/1281192.1281230acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
Article

Trajectory pattern mining

Published:12 August 2007Publication History

ABSTRACT

The increasing pervasiveness of location-acquisition technologies (GPS, GSM networks, etc.) is leading to the collection of large spatio-temporal datasets and to the opportunity of discovering usable knowledge about movement behaviour, which fosters novel applications and services. In this paper, we move towards this direction and develop an extension of the sequential pattern mining paradigm that analyzes the trajectories of moving objects. We introduce trajectory patterns as concise descriptions of frequent behaviours, in terms of both space (i.e., the regions of space visited during movements) and time (i.e., the duration of movements). In this setting, we provide a general formal statement of the novel mining problem and then study several different instantiations of different complexity. The various approaches are then empirically evaluated over real data and synthetic benchmarks, comparing their strengths and weaknesses.

References

  1. R. Agrawal and R. Srikant. Mining sequential patterns. In Proceedings of ICDE, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. K. Ashok. Estimation and Prediction of Time-Dependent Origin-Destination Flows. PhD thesis, Massachusetts Institute of Technology, 1996.Google ScholarGoogle Scholar
  3. H. Cao, N. Mamoulis, and D. W. Cheung. Mining frequent spatio-temporal sequential patterns. In ICDM, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. F. Giannotti, A. Mazzoni, S. Puntoni and C. Renso. Synthetic generation of cellular network positioning data. In GIS '05: Procs of 13th ACM Int. Workshop on Geographic Information Systems, pages 12--20, New York, NY, USA, 2005. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. F. Giannotti, M. Nanni, and D. Pedreschi. Efficient mining of sequences with temporal annotations. In Proc. SIAM Conference on Data Mining, pages 346--357. SIAM, 2006.Google ScholarGoogle Scholar
  6. F. Giannotti, M. Nanni, F. Pinelli, and D. Pedreschi. T-patterns: temporally annotated sequential patterns over trajectories. Technical report, ISTI-CNR, 2006.Google ScholarGoogle Scholar
  7. P. Kalnis, N. Mamoulis, and S. Bakiras. On discovering moving clusters in spatio-temporal data. In Proceedings of 9th International Symposium on Spatial and Temporal Databases, pages 364--381. Springer, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. N. Mamoulis, H. Cao, G. Kollios, M. Hadjieleftheriou, Y. Tao, and D. W. Cheung. Mining, indexing, and querying historical spatiotemporal data. In KDD, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. Pei et al. Prefixspan: Mining sequential patterns by prefix-projected growth. In ICDE, pages 215--225, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A. Vautier, M.-O. Cordier, and R. Quiniou. An inductive database for mining temporal patterns in event sequences. In Proceedings of the workshop on Mining Spatial and Temporal Data, 2000.Google ScholarGoogle Scholar
  11. M. Yoshida et al. Mining sequential patterns including time intervals. In Data Mining and Knowledge Discovery: Theory, Tools and Technology II (SPIE Conference), 2000.Google ScholarGoogle Scholar
  12. M. J. Zaki. Spade: An efficient algorithm for mining frequent sequences. Machine Learning, 42(1/2):31--60, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Trajectory pattern mining

    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
    • Published in

      cover image ACM Conferences
      KDD '07: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
      August 2007
      1080 pages
      ISBN:9781595936097
      DOI:10.1145/1281192

      Copyright © 2007 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: 12 August 2007

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      KDD '07 Paper Acceptance Rate111of573submissions,19%Overall Acceptance Rate1,133of8,635submissions,13%

      Upcoming Conference

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader