A comparison of pruning criteria for probability trees

DOI10.1007/s10994-009-5147-1zbMath1470.68103WikidataQ58012266 ScholiaQ58012266MaRDI QIDQ1959552

Daan Fierens, Hendrik Blockeel, Maurice Bruynooghe, Jan Ramon

Publication date: 7 October 2010

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-009-5147-1

zbMATH Keywords

pruning; decision trees; randomization tests; probability estimation

Mathematics Subject Classification ID

62H30: Classification and discrimination; cluster analysis (statistical aspects)

62G05: Nonparametric estimation

68T05: Learning and adaptive systems in artificial intelligence

Related Items

Exploring Neighborhood Structures with Neighborhood Rough Sets in Classification Learning, A comparison of pruning criteria for probability trees

Uses Software

• UCI-ml
• C4.5

Cites Work

• Inferring decision trees using the minimum description length principle
• Estimating the dimension of a model
• Top-down induction of first-order logical decision trees
• Bayesian network classifiers
• Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables
• Tree induction for probability-based ranking
• Multiple comparisons in induction algorithms
• A comparison of pruning criteria for probability trees
• Coding decision trees
• First order random forests: Learning relational classifiers with complex aggregates
• 10.1162/153244301753344614
• Machine Learning: ECML 2003
• Machine Learning: ECML 2003
• The elements of statistical learning. Data mining, inference, and prediction
• Unnamed Item
• Unnamed Item