Krimp: mining itemsets that compress

DOI10.1007/S10618-010-0202-XMaRDI QIDQ408645zbMATHOpenAlexFDO

Authors Jilles Vreeken, Matthijs van Leeuwen, Arno P. J. M. Siebes

Publication date 11 April 2012

Published in Data Mining and Knowledge Discovery (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/s10618-010-0202-x

zbMATH Keywords

pattern miningpattern selectionitemsetsMDL

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Mining and using sets of patterns through compression
• scientific article; zbMATH DE number 1696694
• Mining Compressing Sequential Patterns
• High utility itemsets mining

Cites work

• scientific article; zbMATH DE number 1696848 (Why is no real title available?)
• scientific article; zbMATH DE number 107774 (Why is no real title available?)
• scientific article; zbMATH DE number 3436645 (Why is no real title available?)
• scientific article; zbMATH DE number 1934545 (Why is no real title available?)
• scientific article; zbMATH DE number 2096810 (Why is no real title available?)
• scientific article; zbMATH DE number 2200689 (Why is no real title available?)
• scientific article; zbMATH DE number 2188025 (Why is no real title available?)
• Discovery Science
• Elements of Information Theory
• Krimp: mining itemsets that compress
• Modeling by shortest data description

Cited in

(31)

• Probabilistic combination of classification rules and its application to medical diagnosis
• Summarizing and understanding large graphs
• Large-scale network motif analysis using compression
• A statistical significance testing approach to mining the most informative set of patterns
• Comparing apples and oranges: measuring differences between exploratory data mining results
• Mint: MDL-based approach for mining interesting numerical pattern sets
• Explaining anomalies in groups with characterizing subspace rules
• Mining and using sets of patterns through compression
• The minimum description length principle for pattern mining: a survey
• Finding robust itemsets under subsampling
• The blind men and the elephant: on meeting the problem of multiple truths in data from clustering and pattern mining perspectives
• On cognitive preferences and the plausibility of rule-based models
• Summarizing transactional databases with overlapped hyperrectangles
• Maximum entropy models and subjective interestingness: an application to tiles in binary databases
• Unsupervised interaction-preserving discretization of multivariate data
• Summarizing categorical data by clustering attributes
• The PRIMPING routine -- tiling through proximal alternating linearized minimization
• Mining Compressing Sequential Patterns
• Exact and approximate minimal pattern mining
• Krimp
• Minimum description length revisited
• Mining mid-level visual patterns with deep CNN activations
• Interesting pattern mining in multi-relational data
• Robust subgroup discovery. Discovering subgroup lists using MDL
• Krimp: mining itemsets that compress
• Skopus: mining top-\(k\) sequential patterns under leverage
• Sampling frequent and minimal Boolean patterns: theory and application in classification
• MiningZinc: a declarative framework for constraint-based mining
• Quantitative Redundancy in Partial Implications
• Grafting for combinatorial binary model using frequent itemset mining
• CSPM: discovering compressing stars in attributed graphs

Describes a project that uses

Uses Software

• SLIQ
• C4.5
• AFOPT
• LUCS-KDD
• GraphScope
• FOIL
• StreamKrimp

This page was built for publication: Krimp: mining itemsets that compress

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408645)