The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Mining frequent patterns without candidate generation
Open accessAbstract
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns.
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
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
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
Efficiently mining long patterns from databases
Bayardo, R. J. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276313 · Cited by 1,302
Beyond market baskets: generalizing association rules to correlations
Brin, S., Motwani, R., & Silverstein, C. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253327 · Cited by 1,281
Efficient mining of emerging patterns: discovering trends and differences
Dong, G., & Li, J. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312191 · Cited by 1,018
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
Self-citationFinding interesting rules from large sets of discovered association rules
Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., & Verkamo, A. I. (1994) · Proceedings of the third international conference on Information and knowledge management - CIKM '94 · doi:10.1145/191246.191314 · Cited by 712
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
Integrating association rule mining with relational database systems: alternatives and implications
Sarawagi, S., Thomas, S., & Agrawal, R. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276335 · Cited by 306
Efficient mining of constrained correlated sets
Grahne, G., Lakshmanan, L. V. S., & Wang, X. (2002) · Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073) · doi:10.1109/icde.2000.839450 · Cited by 162
Cited by
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
“The most outstanding improvement over Apriori would be a method called FP-growth (frequent pattern growth) that succeeded in eliminating candidate generation [36].”
MethodMining 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-citationPrefixSpan,: 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
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-citationSarker, I. H. (2022) · SN Computer Science · doi:10.1007/s42979-022-01043-x · Cited by 1,208
CMAR: accurate and efficient classification based on multiple class-association rules
Li, W., Han, J., & Pei, J. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989541 · Cited by 1,204
Self-citationKuramochi, M., & Karypis, G. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989534 · Cited by 1,068
Algorithms for association rule mining — a general survey and comparison
Hipp, J., Güntzer, U., & Nakhaeizadeh, G. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/360402.360421 · Cited by 962
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
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 algorithms for mining closed itemsets and their lattice structure
Zaki, M. J., & Hsiao, C.-J. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.60 · Cited by 681
CloseGraph: mining closed frequent graph patterns
Yan, X., & Han, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956784 · Cited by 635
Self-citationFast vertical mining using diffsets
Zaki, M. J., & Gouda, K. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956788 · Cited by 593
CLOSET+: 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
Self-citationPredicting source code changes by mining change history
Ying, A. T. T., Murphy, G. C., Ng, R., & Chu-Carroll, M. C. (2004) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2004.52 · Cited by 571
Recommendations in location-based social networks: a survey
Bao, J., Zheng, Y., Wilkie, D., & Mokbel, M. (2015) · GeoInformatica · doi:10.1007/s10707-014-0220-8 · Cited by 570
Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases
Tseng, V. S., Shie, B.-E., Wu, C.-W., & Yu, P. S. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2012.59 · Cited by 570
A Survey on Session-based Recommender Systems
Wang, S., Cao, L., Wang, Y., Sheng, Q. Z., Orgun, M. A., & Lian, D. (2022) · ACM Computing Surveys · doi:10.1145/3465401 · Cited by 570
Sarker, I. H. (2021) · SN Computer Science · doi:10.1007/s42979-021-00765-8 · Cited by 570
Fast algorithms for frequent itemset mining using FP-trees
Grahne, G., & Zhu, J. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.166 · Cited by 549
Real world performance of association rule algorithms
Zheng, Z., Kohavi, R., & Mason, L. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502572 · Cited by 488
Hierarchical Document Clustering Using Frequent Itemsets
Fung, B. C. M., Wang, K., & Ester, M. (2003) · Proceedings of the 2003 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972733.6 · Cited by 471
A data clustering algorithm for mining patterns from event logs
Vaarandi, R. (2004) · Proceedings of the 3rd IEEE Workshop on IP Operations & Management (IPOM 2003) (IEEE Cat. No.03EX764) · doi:10.1109/ipom.2003.1251233 · Cited by 453
Pfp: parallel fp-growth for query recommendation
Li, H., Wang, Y., Zhang, D., Zhang, M., & Chang, E. Y. (2008) · Proceedings of the 2008 ACM conference on Recommender systems · doi:10.1145/1454008.1454027 · Cited by 444
UP-Growth: an efficient algorithm for high utility itemset mining
Tseng, V. S., Wu, C.-W., Shie, B.-E., & Yu, P. S. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835839 · Cited by 442
Alternative interest measures for mining associations in databases
Omiecinski, E. R. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1161582 · Cited by 429
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-citationChan, R., Yang, Q., & Shen, Y.-D. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250893 · Cited by 405
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
Efficiently mining maximal frequent itemsets
Gouda, K., & Zaki, M. J. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989514 · Cited by 397
Finding Frequent Patterns in a Large Sparse Graph*
Kuramochi, M., & Karypis, G. (2005) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-005-0003-9 · Cited by 371
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
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
Clustering event logs using iterative partitioning
Makanju, A. A. O., Zincir-Heywood, A. N., & Milios, E. E. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557154 · Cited by 338
Privacy-preserving anonymization of set-valued data
Terrovitis, M., Mamoulis, N., & Kalnis, P. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453874 · Cited by 326
Depth first generation of long patterns
Agarwal, R. C., Aggarwal, C. C., & Prasad, V. V. V. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347114 · Cited by 325
Fuzzy association rules: general model and applications
Delgado, M., Marin, N., Sanchez, D., & Vila, M.-A. (2003) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2003.809896 · Cited by 325
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
Self-citationAn implementation of the FP-growth algorithm
Borgelt, C. (2005) · Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations · doi:10.1145/1133905.1133907 · Cited by 320
Effective community search for large attributed graphs
Fang, Y., Cheng, R., Luo, S., & Hu, J. (2016) · Proceedings of the VLDB Endowment · doi:10.14778/2994509.2994538 · Cited by 317
Local Probabilistic Models for Link Prediction
Wang, C., Satuluri, V., & Parthasarathy, S. (2007) · Seventh IEEE International Conference on Data Mining (ICDM 2007) · doi:10.1109/icdm.2007.108 · Cited by 314
Sequential pattern mining -- approaches and algorithms
Mooney, C. H., & Roddick, J. F. (2013) · ACM Computing Surveys · doi:10.1145/2431211.2431218 · Cited by 310
On the tradeoff between privacy and utility in data publishing
Li, T., & Li, N. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557079 · Cited by 309
Mining frequent patterns with counting inference
Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., & Lakhal, L. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/380995.381017 · Cited by 303
Frequent pattern mining with uncertain data
Aggarwal, C. C., Li, Y., Wang, J., & Wang, J. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557030 · Cited by 297
Borgelt, C. (2012) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1074 · Cited by 291
An overview on subgroup discovery: foundations and applications
Herrera, F., Carmona, C. J., González, P., & del Jesus, M. J. (2011) · Knowledge and Information Systems · doi:10.1007/s10115-010-0356-2 · Cited by 290
Research issues in data stream association rule mining
Jiang, N., & Gruenwald, L. (2006) · ACM SIGMOD Record · doi:10.1145/1121995.1121998 · Cited by 287
Context-aware music recommendation based on latenttopic sequential patterns
Hariri, N., Mobasher, B., & Burke, R. (2012) · Proceedings of the sixth ACM conference on Recommender systems · doi:10.1145/2365952.2365979 · Cited by 283
The role mining problem: finding a minimal descriptive set of roles
Vaidya, J., Atluri, V., & Guo, Q. (2007) · Proceedings of the 12th ACM symposium on Access control models and technologies · doi:10.1145/1266840.1266870 · Cited by 281
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-citationProtection of Big Data Privacy
Mehmood, A., Natgunanathan, I., Xiang, Y., Hua, G., & Guo, S. (2016) · IEEE Access · doi:10.1109/access.2016.2558446 · Cited by 276
MAFIA: a maximal frequent itemset algorithm
Burdick, D., Calimlim, M., Flannick, J., Gehrke, J., & Yiu, T. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.183 · Cited by 267
Mining top-k frequent closed patterns without minimum support
Han, J., Wang, J., Lu, Y., & Tzvetkov, P. (2003) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1183905 · Cited by 252
Self-citationConstrained 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-citationMining class outliers: concepts, algorithms and applications in CRM
He, Z., Xu, X., Huang, J. Z., & Deng, S. (2004) · Expert Systems with Applications · doi:10.1016/j.eswa.2004.07.002 · Cited by 79
Human Activity Recognition Data Analysis: History, Evolutions, and New Trends
Ariza-Colpas, P. P., Vicario, E., Oviedo-Carrascal, A. I., Butt Aziz, S., Piñeres-Melo, M. A., Quintero-Linero, A., & Patara, F. (2022) · Sensors · doi:10.3390/s22093401 · Cited by 52
“Frequent Itemsets Mining Apriori [60] Apriori-TID [61] ECLAT TID-list [62,63] FP-Growth [64] Big Data Algorithms R-Apriori [65] YAFIM [66] ParEclat [67] Par-FP (Parallel FP-Growth with Sampling) [68] HPA (Hash Partitioned Apriori) [69] Distributed algorithms PEAR (Parallel Efficient Association…”
Lin, W., Ma, M., Pan, D., & Wang, P. (2018) · 2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC) · doi:10.1109/pccc.2018.8711092 · Cited by 29
“Many works improve their performance on that basis, see [20-23].”
BackgroundOn the adoption and impact of predictive analytics for server incident reduction
Giurgiu, I., Wiesmann, D., Bogojeska, J., Lanyi, D., Stark, G., Wallace, R. B., Pereira, M. M., & Hidalgo, A. A. (2017) · IBM Journal of Research and Development · doi:10.1147/jrd.2016.2631400 · Cited by 17
Metadata
- Authors
- Han, J., Pei, J., & Yin, Y.
- Venue
- Proceedings of the 2000 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 2000-05-16
- Pages
- 1-12
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W4252403066
- Cited by
- 3,216
- References
- 10
- FWCI
- 69.33
- Type
- conference paper
- 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.