A Bayesian Random Split to Build Ensembles of Classification Trees

Authors:
Andrés Cano;Andrés R. Masegosa;Serafín Moral
Affiliations:
Department of Computer Science and Artificial Intelligence, University of Granada, Spain;Department of Computer Science and Artificial Intelligence, University of Granada, Spain;Department of Computer Science and Artificial Intelligence, University of Granada, Spain
Venue:
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Year:
2009

Citing 9
Cited 0

Bagging predictors

Machine Learning
Data mining: practical machine learning tools and techniques with Java implementations

Data mining: practical machine learning tools and techniques with Java implementations
An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization

Machine Learning
Random Forests

Machine Learning
An Empirical Comparison of Selection Measures for Decision-Tree Induction

Machine Learning
Induction of Decision Trees

Machine Learning
Extremely randomized trees

Machine Learning
Statistical Comparisons of Classifiers over Multiple Data Sets

The Journal of Machine Learning Research
Combining Decision Trees Based on Imprecise Probabilities and Uncertainty Measures

ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty

Quantified Score

Hi-index	0.00

Visualization

Abstract

Random forest models [1] consist of an ensemble of randomized decision trees. It is one of the best performing classification models. With this idea in mind, in this section we introduced a random split operator based on a Bayesian approach for building a random forest. The convenience of this split method for constructing ensembles of classification trees is justified with an error bias-variance decomposition analysis. This new split operator does not clearly depend on a parameter K as its random forest's counterpart, and performs better with a lower number of trees.