The DOI matches its Crossref record; 86 of the 86 references it cites were found in a registry or an index.
Sequential pattern mining -- approaches and algorithms
Abstract
Sequences of events, items, or tokens occurring in an ordered metric space appear often in data and the requirement to detect and analyze frequent subsequences is a common problem. Sequential Pattern Mining arose as a subfield of data mining to focus on this field. This article surveys the approaches and algorithms proposed to date.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Fast 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
Maintaining knowledge about temporal intervals
Allen, J. F. (1983) · Communications of the ACM · doi:10.1145/182.358434 · Cited by 7,593
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
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
The String-to-String Correction Problem
Wagner, R. A., & Fischer, M. J. (1974) · Journal of the ACM · doi:10.1145/321796.321811 · Cited by 3,032
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
A guided tour to approximate string matching
Navarro, G. (2001) · ACM Computing Surveys · doi:10.1145/375360.375365 · Cited by 2,561
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
Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison
Sankoff, D., & Kruskal, J. B. (1983) · Medical Entomology and Zoology · Cited by 1,915
SPADE: An Efficient Algorithm for Mining Frequent Sequences
Zaki, M. J. (2001) · Machine Learning · doi:10.1023/a:1007652502315 · Cited by 1,858
A symbolic representation of time series, with implications for streaming algorithms
Lin, J., Keogh, E., Lonardi, S., & Chiu, B. (2003) · Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery · doi:10.1145/882082.882086 · Cited by 1,799
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
Discovery of Frequent Episodes in Event Sequences
Mannila, H., Toivonen, H., & Inkeri Verkamo, A. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009748302351 · Cited by 1,463
Frequent pattern mining: current status and future directions
Han, J., Cheng, H., Xin, D., & Yan, X. (2007) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-006-0059-1 · Cited by 1,380
Proceedings of IEEE International Conference on Systems, Man and Cybernetics
(1994) · Proceedings of IEEE International Conference on Systems, Man and Cybernetics · doi:10.1109/icsmc.1994.399796 · Cited by 1,341
Department of Computer Science
(1993) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(93)90083-n · Cited by 1,210
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
Giannotti, F., Nanni, M., Pinelli, F., & Pedreschi, D. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281230 · Cited by 1,010
CHARM: An Efficient Algorithm for Closed Itemset Mining
Zaki, M. J., & Hsiao, C.-J. (2002) · Proceedings of the 2002 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972726.27 · Cited by 929
Gaber, M. M., Zaslavsky, A., & Krishnaswamy, S. (2005) · ACM SIGMOD Record · doi:10.1145/1083784.1083789 · Cited by 886
CLOSET : An Efficient Algorithm for Mining Frequent Closed Itemsets
Pei, J. (2000) · Cited by 828
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
Exploratory mining and pruning optimizations of constrained associations rules
Ng, R. T., Lakshmanan, L. V. S., Han, J., & Pang, A. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276307 · Cited by 715
Discovering Frequent Episodes in Sequences.
Mannila, H., Toivonen, H. T. T., & Verkamo, A. I. (1995) · Knowledge Discovery and Data Mining · Cited by 689
Mining the most interesting rules
Bayardo, R. J., & Agrawal, R. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312219 · Cited by 653
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
Hall, P. A. V., & Dowling, G. R. (1980) · ACM Computing Surveys · doi:10.1145/356827.356830 · Cited by 586 · cited 2×
“Research in this area has been active for some time and includes not only algorithms for string matching using regular expressions [Hall and Dowling 1980; Aho 1990; Breslauer and Ga¸ sieniec 1995; Bentley and Sedgewick 1997; Landau et al. 1998; Sankoff and Kruskal 1999; Chan et al. 2002; Amir et…”
MethodCLOSET+: searching for the best strategies for mining frequent closed itemsets
Wang, J., Han, J., & Pei, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956779 · Cited by 585
A Tree Projection Algorithm for Generation of Frequent Item Sets
Agarwal, R. C., Aggarwal, C. C., & Prasad, V. V. V. (2001) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.2000.1693 · Cited by 510
Mining Frequent Patterns in Data Streams at Multiple Time Granularities
Giannella, C. R., Han, J., Yan, X., & Yu, P. S. (2002) · Cited by 497
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
Proceedings of the 26th International Conference on Data Engineering, ICDE 2010
Li, F., Moro, M. M., Ghandeharizadeh, S., Haritsa, J. R., Weikum, G., Carey, M. J., Casati, F., Chang, E. Y., Manolescu, I., Mehrotra, S., et al. (2010) · Max Planck Institute for Plasma Physics · Cited by 452
SPIRIT: Sequential Pattern Mining with Regular Expression Constraints
Garofalakis, M., Rastogi, R. R., & Shim, K. (1999) · Cited by 445
A taxonomy of sequential pattern mining algorithms
Mabroukeh, N. R., & Ezeife, C. I. (2010) · ACM Computing Surveys · doi:10.1145/1824795.1824798 · Cited by 400
Algorithms for Finding Patterns in Strings
AHO, A. V. (1990) · Algorithms and Complexity · doi:10.1016/b978-0-444-88071-0.50010-2 · Cited by 373
Mining frequent itemsets with convertible constraints
Pei, J., Han, J., & Lakshmanan, L. V. S. (2002) · Proceedings 17th International Conference on Data Engineering · doi:10.1109/icde.2001.914856 · Cited by 324
Ceglar, A., & Roddick, J. F. (2006) · ACM Computing Surveys · doi:10.1145/1132956.1132958 · Cited by 324
Self-citationProceedings of the 2009 International Conference on Artificial Intelligence, ICAI 2009
Garrido, P., Castro, C., & Monfroy, É. (2009) · conference · Cited by 315
Discovering generalized episodes using minimal occurrences
Mannila, H., & Toivonen, H. T. T. (1996) · Cited by 306
(2007) · Advances in Database Systems · doi:10.1007/978-0-387-47534-9 · Cited by 282
Mining frequent patterns by pattern-growth: methodology and implications
Han, J., & Pei, J. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/380995.381002 · Cited by 280
The PSP approach for mining sequential patterns
Masseglia, F., Cathala, F., & Poncelet, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0094818 · Cited by 246
Mining sequential patterns with constraints in large databases
Pei, J., Han, J., & Wang, W. (2002) · Proceedings of the eleventh international conference on Information and knowledge management · doi:10.1145/584792.584799 · Cited by 244
Constraint-based sequential pattern mining: the pattern-growth methods
Pei, J., Han, J., & Wang, W. (2007) · Journal of Intelligent Information Systems · doi:10.1007/s10844-006-0006-z · Cited by 241
Multi-dimensional sequential pattern mining
Pinto, H., Han, J., Pei, J., Wang, K., Chen, Q., & Dayal, U. (2001) · Proceedings of the tenth international conference on Information and knowledge management · doi:10.1145/502585.502600 · Cited by 206
Discovering Temporal Patterns for Interval-based Events
Kam, P.-S., & Fu, A. W.-C. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44466-1_32 · Cited by 193
Landau, G. M., Myers, E. W., & Schmidt, J. P. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539794264810 · Cited by 185
GeoMiner: a system prototype for spatial data mining
Han, J., Koperski, K., & Stefanovic, N. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253404 · Cited by 178
Data Streams: Models and Algorithms (Advances in Database Systems)
Aggarwal, C. C. (2006) · Springer eBooks · Cited by 177
Incremental mining of sequential patterns in large databases
Masseglia, F., Poncelet, P., & Teisseire, M. (2003) · Data & Knowledge Engineering · doi:10.1016/s0169-023x(02)00209-4 · Cited by 164
Mining long sequential patterns in a noisy environment
Yang, J., Wang, W. W., Yu, P. S., & Han, J. (2002) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/564691.564738 · Cited by 158
Discovery of Temporal Patterns. Learning Rules about the Qualitative Behaviour of Time Series
Höppner, F. (2001) · European Conference on Principles of Data Mining and Knowledge Discovery · doi:10.1007/3-540-44794-6_16 · Cited by 152
Sequential Pattern Mining: A Survey
Zhao, Q., & Bhowmick, S. S. (2003) · Cited by 140
A Regression-Based Temporal Pattern Mining Scheme for Data Streams
Teng, W., Chen⋆, M.-S., & Yu, P. S. (2003) · Elsevier eBooks · doi:10.1016/b978-012722442-8/50017-3 · Cited by 135
Constrained frequent pattern mining: a pattern-growth view
Pei, J., & Han, J. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/568574.568580 · Cited by 133
Mining Surprising Patterns Using Temporal Description Length
Chakrabarti, S., Sarawagi, S., & Dom, B. (1998) · Cited by 130
Generalized Sequential Pattern Mining with Item Intervals
Hirate, Y., & Yamana, H. (2006) · Journal of Computers · doi:10.4304/jcp.1.3.51-60 · Cited by 108
Cai, Y. D., Clutter, D., Pape, G., Han, J., Welge, M. E., & Auvil, L. S. (2004) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1007568.1007695 · Cited by 96
Seno, M., & Karypis, G. (2003) · Proceedings · doi:10.1109/icdm.2002.1183937 · Cited by 93
Discovering Frequent Closed Partial Orders from Strings
Pei, J., Wang, H., Liu, J., Wang, K., Wang, J., & Yu, P. S. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.172 · Cited by 90
Parallel Sequence Mining on Shared-Memory Machines
Zaki, M. J. (2001) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.2000.1695 · Cited by 89
Meta-Rule-Guided Mining of Association Rules in Relational Databases.
Fu, Y., & Han, J. (1995) · Cited by 86
The string edit distance matching problem with moves
Cormode, G., & Muthukrishnan, S. (2002) · Symposium on Discrete Algorithms · doi:10.5555/545381.545470 · Cited by 85
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
Applying data mining techniques for descriptive phrase extraction in digital document collections
Ahonen-Myka, H., Heinonen, O., Klemettinen, M., & Verkamo, A. I. (2002) · IEEE International Forum on Research and Technology Advances in Digital Libraries (ADL) · doi:10.1109/adl.1998.670374 · Cited by 82
LPMiner: an algorithm for finding frequent itemsets using length-decreasing support constraint
Seno, M., & Karypis, G. (2002) · Proceedings · doi:10.1109/icdm.2001.989558 · Cited by 82
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
A sublinear algorithm for weakly approximating edit distance
Batu, T., Ergün, F., Kilian, J., Magen, A., Raskhodnikova, S., Rubinfeld, R., & Rahul Sami, D. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780542.780590 · 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
A General Model for Sequential Pattern Mining with a Progressive Database
Huang, J.-W., Tseng, C.-Y., Ou, J.-C., & Chen⋆, M.-S. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.37 · Cited by 65
PLANMINE: sequence mining for plan failures
Zaki, M. J., Lesh, N. B., & Ogihara, M. (1998) · Cited by 60
Constraint-based sequential pattern mining: The consideration of recency and compactness
Chen, Y., & Hu, Y. (2005) · Decision Support Systems · doi:10.1016/j.dss.2005.10.006 · Cited by 59
Identification of hot regions in protein-protein interactions by sequential pattern mining
Hsu, C., Chen, C., Liu, B., Huang, C.-C., Laio, M.-H., Lin, C.-C., & Wu, T.-L. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-s5-s8 · Cited by 57
Parallel tree-projection-based sequence mining algorithms
Guralnik, V., & Karypis, G. (2004) · Parallel Computing · doi:10.1016/j.parco.2004.03.003 · Cited by 50
SQUIRE: Sequential pattern mining with quantities
Kim, C., Lim, J.-H., Ng, R. T., & Shim, K. (2007) · Journal of Systems and Software · doi:10.1016/j.jss.2006.12.562 · Cited by 44
Efficient Algorithms for Incremental Update of Frequent Sequences
Zhang, M., Kao, B., Cheung, D. W.-L., & Yip, C. L. (2002) · Lecture notes in computer science · doi:10.1007/3-540-47887-6_18 · Cited by 43
Mining Sequential Alarm Patterns in a Telecommunication Database
Wu, P., Peng, W.-C., & Chen⋆, M.-S. (1999) · Lecture notes in computer science · doi:10.1007/3-540-45432-2_4 · Cited by 30
Efficient Algorithms For Normalized Edit Distance
Arslan, A. N., & Eğeci̇oğlu, Ö. (2000) · Cited by 27
Guiding Knowledge Discovery Through Interactive Data Mining
Ceglar, A., Roddick, J. F., & Calder, P. (2011) · IGI Global eBooks · doi:10.4018/978-1-59140-057-8.ch004 · Cited by 26
Self-citationThe normalized string editing problem revisited
Oommen, B. J., & Zhang, K. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.506420 · Cited by 24
An efficient uniform-cost normalized edit distance algorithm
Arslan, A. N., & Eğeci̇oğlu, Ö. (2003) · String Processing and Information Retrieval · doi:10.1109/spire.1999.796572 · Cited by 18
SEQUENTIAL PATTERN MINING WITH APPROXIMATED CONSTRAINTS
Antunes, C., & Oliveira, A. L. (2004) · Cited by 13
Cited by
Customer Churn Prediction in Superannuation: A Sequential Pattern Mining Approach
Culbert, B., Fu, B., Brownlow, J., Chu, C., Meng, Q., & Xu, G. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-92013-9_10 · Cited by 2
Metadata
- Authors
- Mooney, C. H., & Roddick, J. F.
- Venue
- ACM Computing Surveys
- Published
- 2013-02
- Volume
- 45
- Issue
- 2
- Pages
- 1-39
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W1985716338
- Cited by
- 310
- References
- 86
- FWCI
- 77.00
- 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.