Krimp: mining itemsets that compress

DOI10.1007/S10618-010-0202-XzbMATH Open1235.68071OpenAlexW2124066753MaRDI QIDQ408645FDOQ408645

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)

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

Recommendations

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

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)

Cites Work

• Krimp: mining itemsets that compress
• Elements of Information Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Discovery Science
• Modeling by shortest data description
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (31)

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

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)