Item Sets That Compress
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
One of the major problems in frequent item set mining is the explosion of the number of results: it is difficult to find the most interesting frequent item sets. The cause of this explosion is that large sets of frequent item sets describe essentially the same set of transactions. In this paper we approach this problem using the MDL principle: the best set of frequent item sets is that set that compresses the database best. We introduce four heuristic algorithms for this task, and the experiments show that these algorithms give a dramatic reduction in the number of frequent item sets. Moreover, we show how our approach can be used to determine the best value for the min-sup threshold.
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 2×
“The cause of this explosion is that large sets of frequent item sets describe essentially the same set of transactions.”
BackgroundMethodMining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
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
Detecting Change in Data Streams
Kifer, D., Ben-David, S., & Gehrke, J. (2004) · Proceedings 2004 VLDB Conference · doi:10.1016/b978-012088469-8.50019-x · Cited by 789
Krimp: mining itemsets that compress
Vreeken, J., van Leeuwen, M., & Siebes, A. (2011) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-010-0202-x · Cited by 300
Self-citationBorgelt, C. (2012) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1074 · Cited by 291
A Survey on Explainable Anomaly Detection
Li, Z., Zhu, Y., & Van Leeuwen, M. (2024) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3609333 · Cited by 139
“They utilise the Krimp algorithm [196] as the compressor, which is trained on exclusively normal samples to capture normal behaviours.”
MethodSelf-citation
Metadata
- Authors
- Siebes, A., Vreeken, J., & Leeuwen, M. V.
- Venue
- Proceedings of the 2006 SIAM International Conference on Data Mining
- Published
- 2006-04-20
- Pages
- 395-406
- OpenAlex
- W37234579
- Cited by
- 165
- References
- 2
- FWCI
- 11.28
- 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: Item Sets That Compress. https://app.cochat.ai/papers/10.1137/1.9781611972764.35
- The paper
- Siebes, A., Vreeken, J., & Leeuwen, M. V. (2006). Item Sets That Compress. Proceedings of the 2006 SIAM International Conference on Data Mining. https://doi.org/10.1137/1.9781611972764.35
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.