The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
CLOSET+: searching for the best strategies for mining frequent closed itemsets
Abstract
Mining frequent closed itemsets provides complete and non-redundant results for frequent pattern analysis. Extensive studies have proposed various strategies for efficient frequent closed itemset mining, such as depth-first search vs. breadthfirst search, vertical formats vs. horizontal formats, tree-structure vs. other data structures, top-down vs. bottom-up traversal, pseudo projection vs. physical projection of conditional database, etc. It is the right time to ask "what are the pros and cons of the strategies?" and "what and how can we pick and integrate the best strategies to achieve higher performance in general cases?"In this study, we answer the above questions by a systematic study of the search strategies and develop a winning algorithm CLOSET+. CLOSET+ integrates the advantages of the previously proposed effective strategies as well as some ones newly developed here. A thorough performance study on synthetic and real data sets has shown the advantages of the strategies and the improvement of CLOSET+ over existing mining algorithms, including CLOSET, CHARM and OP, in terms of runtime, memory usage and scalability.
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 1×
“INTRODUCTION Since the introduction of association rule mining [1], there have been extensive studies on efficient frequent itemset mining methods, such as [2, 11, 16, 6, 4, 3, 8, 7, 18, 10].”
BackgroundFast 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
Self-citationMining 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-citationDynamic 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
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
Discovering Frequent Closed Itemsets for Association Rules
Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_25 · Cited by 1,378
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
Sampling Large Databases for Association Rules
Toivonen, H. T. T. (1996) · Cited by 1,089
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
CLOSET : An Efficient Algorithm for Mining Frequent Closed Itemsets
Pei, J. (2000) · Cited by 828
Self-citationMAFIA: a maximal frequent itemset algorithm for transactional databases
Burdick, D., Calimlim, M., & Gehrke, J. (2002) · Proceedings 17th International Conference on Data Engineering · doi:10.1109/icde.2001.914857 · Cited by 612
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
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-citationSearch through systematic set enumeration
Rymon, R. (1992) · ScholarlyCommons (University of Pennsylvania) · Cited by 388
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-citationMining frequent item sets by opportunistic projection
Liu, J., Pan, Y., Wang, K., & Han, J. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775081 · Cited by 189
Self-citationScalable parallel data mining for association rules
Han, E.-H., Karypis, G., & Kumar, V. (2000) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.846289 · Cited by 174
Cited by
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
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
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
Swarm: mining relaxed temporal moving object clusters
Li, Z., Ding, B., Han, J., & Kays, R. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920934 · Cited by 325
Self-citationCeglar, A., & Roddick, J. F. (2006) · ACM Computing Surveys · doi:10.1145/1132956.1132958 · Cited by 324
Metadata
- Authors
- Wang, J., Han, J., & Pei, J.
- Venue
- Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2003-08-24
- Pages
- 236-245
- OpenAlex
- W2162034534
- Cited by
- 585
- References
- 19
- FWCI
- 32.67
- 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.