A taxonomy of sequential pattern mining algorithms
The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Abstract
Owing to important applications such as mining web page traversal sequences, many algorithms have been introduced in the area of sequential pattern mining over the last decade, most of which have also been modified to support concise representations like closed, maximal, incremental or hierarchical sequences. This article presents a taxonomy of sequential pattern-mining techniques in the literature with web usage mining as an application. This article investigates these algorithms by introducing a taxonomy for classifying sequential pattern-mining algorithms based on important key features supported by the techniques. This classification aims at enhancing understanding of sequential pattern-mining problems, current status of provided solutions, and direction of research in this area. This article also attempts to provide a comparative performance analysis of many of the key techniques and discusses theoretical aspects of the categories in the taxonomy.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907 · cited 9×
“SPADE discovers sequences of subsets of items, not just single item sequences as is the case with Apriori [Agrawal et al. 1993]; it also discovers sequences with arbitrary time”
BackgroundMethodInfluentialFast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
Agrawal, R., & Srikant, R. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380415 · Cited by 5,155
Introduction to Lattices and Order
Davey, B. A., & Priestley, H. A. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9780511809088 · Cited by 4,901
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335372 · Cited by 3,216
Mining sequential patterns: Generalizations and performance improvements
Srikant, R., & Agrawal, R. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014140 · Cited by 2,711
Web usage mining: discovery and applications of usage patterns from Web data
Srivastava, J., Cooley, R., Deshpande, M., & Tan, P.-N. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/846183.846188 · Cited by 2,105
Dynamic itemset counting and implication rules for market basket data
Brin, S., Motwani, R., Ullman, J. D., & Tsur, S. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253325 · Cited by 1,951
SPADE: An Efficient Algorithm for Mining Frequent Sequences
Zaki, M. J. (2001) · Machine Learning · doi:10.1023/a:1007652502315 · Cited by 1,858
PrefixSpan,: mining sequential patterns efficiently by prefix-projected pattern growth
Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., & Hsu, M.-C. (2005) · Proceedings 17th International Conference on Data Engineering · doi:10.1109/icde.2001.914830 · Cited by 1,791
Scalable algorithms for association mining
Zaki, M. J. (2000) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.846291 · Cited by 1,751
Data mining introductory and advanced topics
Dunham, M. H. (2003) · Cited by 1,694
An Efficient Algorithm for Mining Association Rules in Large Databases
Savasere, A., Omiecinski, E. R., & Navathe, S. B. (1995) · Cited by 1,590
An effective hash-based algorithm for mining association rules
Park, J. S., Chen, M.-S., & Yu, P. S. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223813 · Cited by 1,406
Web data mining: exploring hyperlinks, contents, and usage data
(2012) · Choice Reviews Online · doi:10.5860/choice.49-2718 · Cited by 1,179
Sampling Large Databases for Association Rules
Toivonen, H. T. T. (1996) · Cited by 1,089
Sequential PAttern mining using a bitmap representation
Ayres, J., Flannick, J., Gehrke, J., & Yiu, T. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775109 · Cited by 1,082
Discovery of Multiple-Level Association Rules from Large Databases
Han, J., & Fu, Y. (1995) · Cited by 922
FreeSpan: frequent pattern-projected sequential pattern mining
Han, J., Pei, J., Mortazavi-Asl, B., Chen, Q., Dayal, U., & Hsu, M.-C. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347167 · Cited by 808
BIDE: efficient mining of frequent closed sequences
Wang, J., & Han, J. (2004) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.2004.1319986 · Cited by 616
Mining Access Patterns Efficiently from Web Logs
Pei, J., Han, J., Mortazavi-asl, B., & Zhu, H. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45571-x_47 · Cited by 496
Search through systematic set enumeration
Rymon, R. (1992) · ScholarlyCommons (University of Pennsylvania) · Cited by 388
Mining interesting knowledge from weblogs: a survey
Facca, F. M., & Lanzi, P. L. (2005) · Data & Knowledge Engineering · doi:10.1016/j.datak.2004.08.001 · Cited by 316
Nandi, A., & Jagadish, H. V. (2007) · Very Large Data Bases · Cited by 86
LAPIN-SPAM: An Improved Algorithm for Mining Sequential Pattern
Yang, Z., & Kitsuregawa, M. (2005) · IEEE International Conference on Data Engineering Workshops (ICDEW) · doi:10.1109/icde.2005.235 · Cited by 85
El-Sayed, M., Ruiz, C., & Rundensteiner, E. A. (2004) · ACM International Workshop on Web Information and Data Management (WIDM) · doi:10.1145/1031453.1031477 · Cited by 78
An efficient algorithm for mining frequent sequences by a new strategy without support counting
Chiu, D.-Y., Wu, Y., & Chen, A. L. P. (2004) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.2004.1320012 · Cited by 76
Goethals, B. (2009) · Springer eBooks · doi:10.1007/978-0-387-09823-4_16 · Cited by 72
Recent Developments in Web Usage Mining Research
Facca, F. M., & Lanzi, P. L. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45228-7_15 · Cited by 45
Sequential Pattern Mining Algorithms: Trade-offs between Speed and Memory
Antunes, C., & Oliveira, A. L. (2004) · Cited by 36
Cited by
Sequence-Aware Recommender Systems
Quadrana, M., Cremonesi, P., & Jannach, D. (2019) · ACM Computing Surveys · doi:10.1145/3190616 · Cited by 504
Sequential pattern mining -- approaches and algorithms
Mooney, C. H., & Roddick, J. F. (2013) · ACM Computing Surveys · doi:10.1145/2431211.2431218 · Cited by 310
Data science for building energy management: A review
Molina-Solana, M., Ros, M., Ruiz, M. D., Gómez-Romero, J., & Martin-Bautista, M. J. (2017) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2016.11.132 · Cited by 287
Tarus, J. K., Niu, Z., & Yousif, A. (2017) · Future Generation Computer Systems · doi:10.1016/j.future.2017.02.049 · Cited by 284
High-throughput phenotyping with temporal sequences
Estiri, H., Strasser, Z. H., & Murphy, S. N. (2021) · Journal of the American Medical Informatics Association · doi:10.1093/jamia/ocaa288 · Cited by 26
Metadata
- Authors
- Mabroukeh, N. R., & Ezeife, C. I.
- Venue
- ACM Computing Surveys
- Published
- 2010-11
- Volume
- 43
- Issue
- 1
- Pages
- 1-41
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2146606092
- Cited by
- 400
- References
- 32
- FWCI
- 52.41
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.