Krimp: mining itemsets that compress
From MaRDI portal
Publication:408645
DOI10.1007/s10618-010-0202-xzbMath1235.68071OpenAlexW2124066753MaRDI QIDQ408645
Jilles Vreeken, Arno P. J. M. Siebes, Matthijs van Leeuwen
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
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)
Related Items
Mint: MDL-based approach for mining interesting numerical pattern sets, Probabilistic combination of classification rules and its application to medical diagnosis, Krimp: mining itemsets that compress, Summarizing transactional databases with overlapped hyperrectangles, Maximum entropy models and subjective interestingness: an application to tiles in binary databases, Mining mid-level visual patterns with deep CNN activations, CSPM: discovering compressing stars in attributed graphs, Summarizing categorical data by clustering attributes, Comparing apples and oranges: measuring differences between exploratory data mining results, A statistical significance testing approach to mining the most informative set of patterns, Large-scale network motif analysis using compression, Sampling frequent and minimal Boolean patterns: theory and application in classification, The PRIMPING routine -- tiling through proximal alternating linearized minimization, Skopus: mining top-\(k\) sequential patterns under leverage, Explaining anomalies in groups with characterizing subspace rules, MiningZinc: a declarative framework for constraint-based mining, 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, Interesting pattern mining in multi-relational data, Mining Compressing Sequential Patterns, Summarizing and understanding large graphs, Krimp, Minimum description length revisited, On cognitive preferences and the plausibility of rule-based models, Quantitative Redundancy in Partial Implications, The minimum description length principle for pattern mining: a survey, Robust subgroup discovery. Discovering subgroup lists using MDL
Uses Software
Cites Work
