skip to main content
10.1145/2513591.2513653acmotherconferencesArticle/Chapter ViewAbstractPublication PagesideasConference Proceedingsconference-collections
research-article

Sequential pattern mining from trajectory data

Published:09 October 2013Publication History

ABSTRACT

In this paper, we study the problem of mining for frequent trajectories, which is crucial in many application scenarios, such as vehicle traffic management, hand-off in cellular networks, supply chain management. We approach this problem as that of mining for frequent sequential patterns. Our approach consists of a partitioning strategy for incoming streams of trajectories in order to reduce the trajectory size and represent trajectories as strings. We mine frequent trajectories using a sliding windows approach combined with a counting algorithm that allows us to promptly update the frequency of patterns. In order to make counting really efficient, we represent frequent trajectories by prime numbers, whereby the Chinese reminder theorem can then be used to expedite the computation.

References

  1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In VLDB, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Johannes Fischer, Volker Heun, and Stefan Kramer. Optimal string mining under frequency constraints. In PKDD, pages 139--150, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Fosca Giannotti, Mirco Nanni, Fabio Pinelli, and Dino Pedreschi. Trajectory pattern mining. In KDD, pages 330--339, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In SIGMOD, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. H. Jeung, M. Lung Yiu, X. Zhou, C. S. Jensen, and H. T. Shen. Discovery of convoys in trajectory databases. PVLDB, 1(1): 1068--1080, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. I. T. Jolliffe. Principal Component Analysis. Springer Series in Statistics, 2002.Google ScholarGoogle Scholar
  7. A. Kügel and E. Ohlebusch. A space efficient solution to the frequent string mining problem for many databases. Data Min. Knowl. Discov., 17(1): 24--38, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. C.-H. Lee and C.-W. Chung. Efficient storage scheme and query processing for supply chain management using rfid. In SIGMOD08, pages 291--302, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  10. J.-G. Lee, J. Han, and K-Y Whang. Trajectory clustering: a partition-and-group framework. In SIGMOD07, pages 593--604, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Li, D. Maier, K. Tufte, V. Papadimos, and P. A. Tucker. No pane, no gain: efficient evaluation of sliding-window aggregates over data streams. SIGMOD Rec., 34(1): 39--44, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Y. Liu, L. Chen., J. Pei, Q. Chen, and Y. Zhao. Mining frequent trajectory patterns for activity monitoring using radio frequency tag arrays. In PerCom, pages 37--46, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. E. Masciari. Trajectory clustering via effective partitioning. In FQAS, pages 358--370, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Elio Masciari. Warehousing and querying trajectory data streams with error estimation. In DOLAP, pages 113--120, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. B. Mozafari, H. Thakkar, and C. Zaniolo. Verifying and mining frequent patterns from large windows over data streams. In ICDE, pages 179--188, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Y. Zheng, Q. Li, Y. Chen, and X. Xie. Understanding mobility based on gps data. In UbiComp 2008, pages 312--321, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  1. Sequential pattern mining from trajectory data

    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 Other conferences
      IDEAS '13: Proceedings of the 17th International Database Engineering & Applications Symposium
      October 2013
      222 pages
      ISBN:9781450320252
      DOI:10.1145/2513591

      Copyright © 2013 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: 9 October 2013

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      IDEAS '13 Paper Acceptance Rate9of51submissions,18%Overall Acceptance Rate74of210submissions,35%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader