The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
PrefixSpan,: mining sequential patterns efficiently by prefix-projected pattern growth
Abstract
Sequential pattern mining is an important data mining problem with broad applications. It is challenging since one may need to examine a combinatorially explosive number of possible subsequence patterns. Most of the previously developed sequential pattern mining methods follow the methodology of \t which may substantially reduce the number of combinations to be examined. However, \t still encounters problems when a sequence database is large and/or when sequential patterns to be mined are numerous and/or long. In this paper, we propose a novel sequential pattern mining method, called PrefixSpan (i.e., Prefix-projected Sequential pattern mining), which explores prefixprojection in sequential pattern mining. PrefixSpan mines the complete set of patterns but greatly reduces the efforts of candidate subsequence generation. Moreover, prefix-projection substantially reduces the size of projected databases and leads to efficient processing. Our performance study shows that PrefixSpan outperforms both the -based GSP algorithm and another recently proposed method, FreeSpan, in mining large sequence databases. 1
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
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
Self-citationAgrawal, 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
Self-citationMining sequential patterns: Generalizations and performance improvements
Srikant, R., & Agrawal, R. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014140 · Cited by 2,711
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
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
Self-citationEfficient mining of partial periodic patterns in time series database
Han, J., Dong, G., & Yin, Y. (1999) · Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) · doi:10.1109/icde.1999.754913 · Cited by 587
Self-citationSPIRIT: Sequential Pattern Mining with Regular Expression Constraints
Garofalakis, M., Rastogi, R. R., & Shim, K. (1999) · Cited by 445
Özden, B., Ramaswamy, S., & Silberschatz, A. (2002) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.1998.655804 · Cited by 411
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Top 10 algorithms in data mining
Wu, X., Kumar, V., Ross Quinlan, J., Ghosh, J., Yang, Q., Motoda, H., McLachlan, G. J., Ng, A., Liu, B., Yu, P. S., et al. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0114-2 · Cited by 5,667
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
Han, J., Pei, J., Yin, Y., & Mao, R. (2004) · Data Mining and Knowledge Discovery · doi:10.1023/b:dami.0000005258.31418.83 · Cited by 2,629
Self-citationYe, K., Schulz, M. H., Long, Q., Apweiler, R., & Ning, Z. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp394 · Cited by 2,022
gSpan: graph-based substructure pattern mining
Yan, X., & Han, J. (2003) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1184038 · Cited by 2,013
Self-citationFrequent 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
Self-citationMining sequential patterns by pattern-growth: the PrefixSpan approach
Pei, J., Han, J., Mortazavi-Asl, B., Wang, J., Pinto, H., Chen, Q., Dayal, U., & Hsu, M.-C. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.77 · Cited by 1,340
Self-citationSequential 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
Data mining in course management systems: Moodle case study and tutorial
Romero, C., Ventura, S., & García, E. (2008) · Computers & Education · doi:10.1016/j.compedu.2007.05.016 · Cited by 1,058
Tsai, C.-W., Lai, C.-F., Chao, H.-C., & Vasilakos, A. V. (2015) · Journal of Big Data · doi:10.1186/s40537-015-0030-3 · Cited by 818
Activity recognition on streaming sensor data
Krishnan, N. C., & Cook, D. J. (2014) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2012.07.003 · Cited by 488
Discovering Activities to Recognize and Track in a Smart Environment
Rashidi, P., Cook, D. J., Holder, L. B., & Schmitter-Edgecombe, M. (2011) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.148 · Cited by 462
H-mine: hyper-structure mining of frequent patterns in large databases
Pei, J., Han, J., Lu, H., Nishio, S., Tang, S., & Yang, D. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989550 · Cited by 408
Self-citationA taxonomy of sequential pattern mining algorithms
Mabroukeh, N. R., & Ezeife, C. I. (2010) · ACM Computing Surveys · doi:10.1145/1824795.1824798 · Cited by 400
Discriminative Frequent Pattern Analysis for Effective Classification
Cheng, H., Yan, X., Han, J., & Hsu, C.-W. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367917 · Cited by 357
Self-citationAn efficient algorithm for discovering frequent subgraphs
Kuramochi, M., & Karypis, G. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.33 · Cited by 352
A survey of frequent subgraph mining algorithms
Jiang, C., Coenen, F., & Zito, M. (2013) · The Knowledge Engineering Review · doi:10.1017/s0269888912000331 · Cited by 346
Effective Pattern Discovery for Text Mining
Zhong, N., Li, Y., & Wu, S.-T. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.211 · Cited by 340
Sequential pattern mining -- approaches and algorithms
Mooney, C. H., & Roddick, J. F. (2013) · ACM Computing Surveys · doi:10.1145/2431211.2431218 · Cited by 310
Clustering and Sequential Pattern Mining of Online Collaborative Learning Data
Perera, D., Kay, J., Koprinska, I., Yacef, K., & Zaiane, O. R. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.138 · Cited by 295
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
Self-citationFinding question-answer pairs from online forums
Cong, G., Wang, L., Lin, C.-Y., Song, Y.-I., & Sun, Y. (2008) · Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1390334.1390415 · Cited by 278
A Survey of Utility-Oriented Pattern Mining
Gan, W., Lin, J. C.-W., Fournier-Viger, P., Chao, H.-C., Tseng, V. S., & Yu, P. S. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2019.2942594 · Cited by 257
Anomaly Detection Using Program Control Flow Graph Mining From Execution Logs
Nandi, A., Mandal, A., Atreja, S., Dasgupta, G. B., & Bhattacharya, S. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939712 · Cited by 154
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
Self-citationAsher, L., Collins, L. M., Ortiz-Pelaez, A., Drewe, J. A., Nicol, C. J., & Pfeiffer, D. U. (2009) · Journal of The Royal Society Interface · doi:10.1098/rsif.2009.0221 · Cited by 102
BUILDING USER TASK SPACE BY MINING TEMPORALLY PROXIMATE DESKTOP ACTIONS
Mirza, H. T., Chen, L., Majid, A., & Chen, G. (2011) · Cybernetics and Systems · doi:10.1080/01969722.2011.634675 · Cited by 2
Metadata
- Authors
- Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., & Hsu, M.-C.
- Venue
- Proceedings 17th International Conference on Data Engineering
- Publisher
- IEEE Comput. Soc
- Published
- 2005-08-29
- Pages
- 215-224
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W2147694185
- Cited by
- 1,791
- References
- 10
- FWCI
- 92.70
- Type
- conference paper
- 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.