Learning with decision lists of data-dependent features

MaRDI QIDQ3093258zbMATH OpenFDO

Authors Mario Marchand, Marina Sokolova

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v6/marchand05a.html

zbMATH Keywords

model selectionlearning theorysparsitysample compressiondata-dependent featuresdecision list machinesset covering machines

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• 10.1162/jmlr.2003.3.4-5.723
• Generalization error bounds for threshold decision lists
• 10.1162/153244302760200650
• 10.1162/153244303765208403
• scientific article; zbMATH DE number 1804114

Cited in

(15)

• The Delaunay triangulation learner and its ensembles
• Learning certifiably optimal rule lists for categorical data
• 10.1162/153244303765208403
• Classification with guaranteed probability of error
• Learning a priori constrained weighted majority votes
• 10.1162/jmlr.2003.3.4-5.723
• Using decision lists to construct interpretable and parsimonious treatment regimes
• Hierarchical linear support vector machine
• Interpretable dynamic treatment regimes
• Generalization error bounds for threshold decision lists
• Interpretable machine learning: fundamental principles and 10 grand challenges
• Learning the set covering machine by bound minimization and margin-sparsity trade-off
• 10.1162/153244302760200650
• Learning customized and optimized lists of rules with mathematical programming
• Interpretable classifiers using rules and Bayesian analysis: building a better stroke prediction model

This page was built for publication: Learning with decision lists of data-dependent features

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