Classification and trees

Authors:
Luc Devroye
Affiliations:
School of Computer Science, McGill University, Montreal, Canada
Venue:
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Year:
2010

Citing 6
Cited 0

Bagging predictors

Machine Learning
Shape quantization and recognition with randomized trees

Neural Computation
An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization

Machine Learning
Random Forests

Machine Learning
Ensemble Methods in Machine Learning

MCS '00 Proceedings of the First International Workshop on Multiple Classifier Systems
Consistency of Random Forests and Other Averaging Classifiers

The Journal of Machine Learning Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Breiman, Friedman, Gordon and Stone recognized that tree classifiers would be very valuable to practicing statisticians. Their cart algorithm became very popular indeed. Designing tree-based classifiers, however, has its pitfalls. It is easy to make them too simple or too complicated so that Bayes risk consistency is compromised. In this talk, we explore the relationship between algorithmic complexity of tree-based methods and performance.