Robust subgroup discovery. Discovering subgroup lists using MDL

DOI10.1007/S10618-022-00856-XMaRDI QIDQ2097449zbMATH OpenOpenAlexWikidataFDO

Authors Hugo M. Proença, Thomas Bäck, Matthijs van Leeuwen, Peter D. Grünwald

Publication date 14 November 2022

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10618-022-00856-x

zbMATH Keywords

interpretabilitysubgroup discoveryminimum description length (MDL) principlesubgroup list

Mathematics Subject Classification ID

Hypothesis testing in multivariate analysis (62H15)

Recommendations

• Fast exhaustive subgroup discovery with numerical target concepts
• For real: a thorough look at numeric attributes in subgroup discovery
• Secure Top-k Subgroup Discovery
• scientific article; zbMATH DE number 1946861
• Exceptional Model Mining

Cites work

• scientific article; zbMATH DE number 4095371 (Why is no real title available?)
• scientific article; zbMATH DE number 3637090 (Why is no real title available?)
• scientific article; zbMATH DE number 1150732 (Why is no real title available?)
• scientific article; zbMATH DE number 3017431 (Why is no real title available?)
• scientific article; zbMATH DE number 861625 (Why is no real title available?)
• scientific article; zbMATH DE number 6253944 (Why is no real title available?)
• A Mathematical Theory of Communication
• A tutorial on statistically sound pattern discovery
• A universal prior for integers and estimation by minimum description length
• Anytime discovery of a diverse set of patterns with Monte Carlo tree search
• Bayes Factors
• Discovering significant patterns
• Estimating the dimension of a model
• For real: a thorough look at numeric attributes in subgroup discovery
• Foundations of Rule Learning
• Identifying consistent statements about numerical data with dispersion-corrected subgroup discovery
• Information Theory and Statistical Mechanics
• Interpretable classifiers using rules and Bayesian analysis: building a better stroke prediction model
• Krimp: mining itemsets that compress
• Learning certifiably optimal rule lists for categorical data
• Machine learning and knowledge discovery in databases. European conference, ECML PKDD 2011, Athens, Greece, September 5--9, 2011. Proceedings, Part III
• Minimum description length revisited
• Mint: MDL-based approach for mining interesting numerical pattern sets
• Modeling by shortest data description
• On Information and Sufficiency
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Separate-and-conquer rule learning
• Statistical comparisons of classifiers over multiple data sets

Cited in

(4)

• Fast exhaustive subgroup discovery with numerical target concepts
• Anytime discovery of a diverse set of patterns with Monte Carlo tree search
• For real: a thorough look at numeric attributes in subgroup discovery
• scientific article; zbMATH DE number 1946861 (Why is no real title available?)

Describes a project that uses

Uses Software

• NMEEF-SD
• Krimp
• CMAR
• ElemStatLearn
• MULAN
• KEEL
• JStatCom
• UCI

This page was built for publication: Robust subgroup discovery. Discovering subgroup lists using MDL

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