A comparison of pruning criteria for probability trees

DOI10.1007/S10994-009-5147-1MaRDI QIDQ1959552zbMATH OpenOpenAlexWikidataFDO

Authors Daan Fierens, Jan Ramon, Hendrik Blockeel, Maurice Bruynooghe

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

decision treesprobability estimationpruningrandomization tests

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Improving the AUC of probabilistic estimation trees.
• The effects of pruning methods on the predictive accuracy of induced decision trees
• scientific article; zbMATH DE number 1753147
• Tree induction for probability-based ranking
• Analysis of a complexity-based pruning scheme for classification trees

Cites work

• A comparison of pruning criteria for probability trees
• Bayesian network classifiers
• Coding decision trees
• Dependency networks for inference, collaborative filtering, and data visualization
• Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables
• Estimating the dimension of a model
• First order random forests: Learning relational classifiers with complex aggregates
• scientific article; zbMATH DE number 1651999 (Why is no real title available?)
• scientific article; zbMATH DE number 1222293 (Why is no real title available?)
• Improving the AUC of probabilistic estimation trees.
• Inferring decision trees using the minimum description length principle
• Multiple comparisons in induction algorithms
• The elements of statistical learning. Data mining, inference, and prediction
• Top-down induction of first-order logical decision trees
• Tree induction for probability-based ranking
• Volume under the ROC surface for multi-class problems.

Cited in

(15)

• A \(k\)-norm pruning algorithm for decision tree classifiers based on error rate estimation
• An investigation on the conditions of pruning an induced decision tree
• Tree induction for probability-based ranking
• A comparison of pruning criteria for probability trees
• The effects of pruning methods on the predictive accuracy of induced decision trees
• Preference summaries for stochastic tree rollback
• FBP: a frontier-based tree-pruning algorithm
• An MLE strategy for combining optimally pruned decision trees
• Analysis of a complexity-based pruning scheme for classification trees
• Exploring Neighborhood Structures with Neighborhood Rough Sets in Classification Learning
• Improved class probability estimates from decision tree models
• Machine Learning: ECML 2004
• scientific article; zbMATH DE number 2219698 (Why is no real title available?)
• Improving the AUC of probabilistic estimation trees.
• Maximum a posteriori pruning on decision trees and its application to bootstrap bumping

Describes a project that uses

Uses Software

• C4.5
• UCI

This page was built for publication: A comparison of pruning criteria for probability trees

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