Selective Rademacher penalization and reduced error pruning of decision trees

MaRDI QIDQ3093218zbMATH OpenFDO

Authors Matti Kääriäinen, Tuomo Malinen, Tapio Elomaa

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v5/kaariainen04a.html

zbMATH Keywords

data-dependent generalization error boundsdecision treesgeneralization error analysisRademacher complexityreduced error pruning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Rademacher penalties and structural risk minimization
• Local Rademacher complexities
• 10.1162/153244303321897690
• scientific article; zbMATH DE number 1804106
• An improved analysis of the Rademacher data-dependent bound using its self bounding property

Cited in

(2)

• A \(k\)-norm pruning algorithm for decision tree classifiers based on error rate estimation
• scientific article; zbMATH DE number 5158889 (Why is no real title available?)

This page was built for publication: Selective Rademacher penalization and reduced error pruning of decision trees

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