The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
SPADE: An Efficient Algorithm for Mining Frequent Sequences
Open accessOverview
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
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 sequential patterns: Generalizations and performance improvements
Srikant, R., & Agrawal, R. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014140 · Cited by 2,711
Fast discovery of association rules
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H. T. T., & Verkamo, A. I. (1996) · Knowledge Discovery and Data Mining · Cited by 2,376
An Efficient Algorithm for Mining Association Rules in Large Databases
Savasere, A., Omiecinski, E. R., & Navathe, S. B. (1995) · Cited by 1,590
New algorithms for fast discovery of association rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., & Wei, L. (1997) · Cited by 1,126
Self-citationIntroduction to lattices and order
(1991) · Choice Reviews Online · doi:10.5860/choice.28-3334 · Cited by 1,122
Discovering Frequent Episodes in Sequences.
Mannila, H., Toivonen, H. T. T., & Verkamo, A. I. (1995) · Knowledge Discovery and Data Mining · Cited by 689
Parallel Algorithms for Discovery of Association Rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., Li, W., Stolorz, P., & Musick, R. (1997) · Scalable High Performance Computing for Knowledge Discovery and Data Mining · doi:10.1007/978-1-4615-5669-5_1 · Cited by 264
Self-citationTRIPs: an integrated intelligent problem-solving assistant
Ferguson, G., & Allen, J. F. (1998) · Cited by 210
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
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
Mining 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
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
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
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
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
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
Ceglar, A., & Roddick, J. F. (2006) · ACM Computing Surveys · doi:10.1145/1132956.1132958 · Cited by 324
Sequential pattern mining -- approaches and algorithms
Mooney, C. H., & Roddick, J. F. (2013) · ACM Computing Surveys · doi:10.1145/2431211.2431218 · Cited by 310
Mining, indexing, and querying historical spatiotemporal data
Mamoulis, N., Cao, H., Kollios, G., Hadjieleftheriou, M., Tao, Y., & Cheung, D. W. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014080 · Cited by 289
Rashidi, P., & Cook, D. J. (2013) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2508037.2508045 · Cited by 94
Intent classification of short-text on social media,
Purohit, H., Dong, G., Shalin, V., Thirunarayan, K., & Sheth, A. (2015) · 2015 IEEE International Conference on Smart City/SocialCom/SustainCom (SmartCity) · doi:10.1109/smartcity.2015.75 · Cited by 66
“For feature set CTK, we used the preprocessed text corpus A and employed the SPADE [29] algorithm for mining sequential frequent patterns per class.”
MethodDai, Y., Xiao, J.-Y., Huang, Y., Zhai, X., Wai, F.-C., & Zhang, M. (2025) · Applied Sciences · doi:10.3390/app15052369 · Cited by 39
A Method of Extracting The Semi-structured Data Implication Rules
Lin, Y., Jun, Z., Hongyan, M., Zhongwei, Z., & Zhanfang, F. (2018) · Procedia Computer Science · doi:10.1016/j.procs.2018.04.315 · Cited by 19
Explaining and predicting abnormal expenses at large scale using knowledge graph based reasoning
Lecue, F., & Wu, J. (2017) · Journal of Web Semantics · doi:10.1016/j.websem.2017.05.003 · Cited by 9
Metadata
- Authors
- Zaki, M. J.
- Venue
- Machine Learning
- Published
- 2001-01
- Volume
- 42
- Issue
- 1-2
- Pages
- 31-60
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W1608194207
- Cited by
- 1,858
- References
- 11
- FWCI
- 79.52
- Type
- journal article
- Language
- en
- Open access
- bronze
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.