The DOI matches its Crossref record.
CHARM: An Efficient Algorithm for Closed Itemset Mining
Abstract
The set of frequent closed itemsets uniquely determines the exact frequency of all itemsets, yet it can be orders of magnitude smaller than the set of all frequent itemsets. In this paper we present CHARM, an efficient algorithm for mining all frequent closed itemsets. It enumerates closed sets using a dual itemset-tidset search tree, using an efficient hybrid search that skips many levels. It also uses a technique called diffsets to reduce the memory footprint of intermediate computations. Finally it uses a fast hash-based approach to remove any “non-closed” sets found during computation. An extensive experimental evaluation on a number of real and synthetic databases shows that CHARM significantly outperforms previous methods. It is also linearly scalable in the number of transactions.
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
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
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
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
Tumor stratification by a novel graph-regularized bi-clique finding algorithm
Ahmadi Adl, A., & Qian, X. (2015) · Computational Biology and Chemistry · doi:10.1016/j.compbiolchem.2015.02.010 · Cited by 3
Metadata
- Authors
- Zaki, M. J., & Hsiao, C.-J.
- Venue
- Proceedings of the 2002 SIAM International Conference on Data Mining
- Published
- 2002-04-11
- Pages
- 457-473
- OpenAlex
- W1537336823
- Cited by
- 929
- References
- 0
- FWCI
- 37.51
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: CHARM: An Efficient Algorithm for Closed Itemset Mining. https://app.cochat.ai/papers/10.1137/1.9781611972726.27
- The paper
- Zaki, M. J., & Hsiao, C.-J. (2002). CHARM: An Efficient Algorithm for Closed Itemset Mining. Proceedings of the 2002 SIAM International Conference on Data Mining. https://doi.org/10.1137/1.9781611972726.27
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.
