PAPER DIGEST
Most Influential KDD 2003 Paper · 2026-03 edition

CLOSET+: Searching For The Best Strategies For Mining Frequent Closed Itemsets

Jianyong Wang; Jiawei Han; Jian Pei

Venue
ACM SIGKDD Conference (KDD) 2003
Recognition
Most Influential KDD 2003 Paper (Rank No. 8)
Edition
2026-03
Impact factor
7
Certificate ID
9c8697dc91d7a953

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 <i>"what are the pros and cons of the strategies?"</i> and <i>"what and how can we pick and integrate the best strategies to achieve higher performance in general cases?"</i>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.

Download PDF certificate