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

Sequential PAttern mining using a bitmap representation

Published:23 July 2002Publication History

ABSTRACT

We introduce a new algorithm for mining sequential patterns. Our algorithm is especially efficient when the sequential patterns in the database are very long. We introduce a novel depth-first search strategy that integrates a depth-first traversal of the search space with effective pruning mechanisms.Our implementation of the search strategy combines a vertical bitmap representation of the database with efficient support counting. A salient feature of our algorithm is that it incrementally outputs new frequent itemsets in an online fashion.In a thorough experimental evaluation of our algorithm on standard benchmark data from the literature, our algorithm outperforms previous work up to an order of magnitude.

References

  1. R. Agrawal and R. Srikant. Fast Algorithms for Mining Association Rules in Large Databases. In Proceedings of the Twentieth International Conference on Very Large Databases, pages 487--499, Santiago, Chile, 1994.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. R. Agrawal and R. Srikant. Mining Sequential Patterns. In ICDE 1995, Taipei, Taiwan, March 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. R. J. Bayardo. Efficiently mining long patterns from databases. In SIGMOD 1998, pages 85--93, 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. C. Bettini, X. S. Wang, and S. Jajodia. Mining temporal relationships with multiple granularities in time sequences. Data Engineering Bulletin, 21(1):32--38, 1998.]]Google ScholarGoogle Scholar
  5. D. Burdick, M. Calimlim, and J. Gehrke. Mafia: A maximal frequent itemset algorithm for transactional databases. In ICDE 2001, Heidelberg, Germany, 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. Garofalakis, R. Rastogi, and K. Shim. SPIRIT: Sequential pattern mining with regular expression constraints. In VLDB 1999, pages 223--234, San Francisco, Sept. 1999. Morgan Kaufmann.]] Google ScholarGoogle Scholar
  7. J. Han, G. Dong, and Y. Yin. Efficient mining of partial periodic patterns in time series database. In ICDE 1999, pages 106--115, Sydney, Australia, Mar. 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. H. Mannila, H. Toivonen, and A. I. Verkamo. Discovering frequent episodes in sequences. In KDD 1995, pages 210--215, Montreal, Quebec, Canada, 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu. PrefixSpan mining sequential patterns efficiently by prefix projected pattern growth. In ICDE 2001, pages 215--226, Heidelberg, Germany, Apr. 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. R. Srikant and R. Agrawal. Mining Sequential Patterns: Generalizations and Performance Improvements. In EDBT 1996, Avignon, France, March 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. R. Srikant and R. Agrawal. Mining sequential patterns: Generalizations and performance improvements. In P. M. G. Apers, M. Bouzeghoub, and G. Gardarin, editors, EDBT 1996, pages 3--17, 25--29 Mar. 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Sequential PAttern mining using a bitmap representation

          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 '02: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
            July 2002
            719 pages
            ISBN:158113567X
            DOI:10.1145/775047

            Copyright © 2002 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: 23 July 2002

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            KDD '02 Paper Acceptance Rate44of307submissions,14%Overall Acceptance Rate1,133of8,635submissions,13%

            Upcoming Conference

            KDD '24

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader