Comparer des méthodes

	Arbre de décision ensembliste	Bagging (Bootstrap Aggregating)	Extra Trees
Domaine	Apprentissage automatique	Apprentissage automatique	Apprentissage automatique
Famille	Machine learning	Machine learning	Machine learning
Année d'origine	1996–2000	1996	2006
Auteur d'origine	Breiman, L.; Dietterich, T. G.	Breiman, L.	Geurts, P.; Ernst, D.; Wehenkel, L.
Type	Ensemble (multiple decision trees combined)	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)	Ensemble (extremely randomized decision trees)
Source fondatrice	Dietterich, T. G. (2000). Ensemble methods in machine learning. In Multiple Classifier Systems, Lecture Notes in Computer Science, vol. 1857, pp. 1–15. Springer, Berlin, Heidelberg.	Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140.	Geurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42.
Alias	decision tree ensemble, ensemble of decision trees, combined decision trees, multiple classifier system (decision trees)	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor	Extremely Randomized Trees, ExtraTreesClassifier, ExtraTreesRegressor, ET
Apparentées	6	5	5
Résumé	Ensemble Decision Tree methods train multiple decision trees and combine their outputs to produce predictions that are more accurate and stable than any single tree. Covering strategies such as bagging, random subspacing, and voting, they are among the most effective off-the-shelf techniques for tabular classification and regression tasks.	Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner.	Extra Trees (Extremely Randomized Trees), introduced by Geurts, Ernst, and Wehenkel in 2006, is an ensemble of decision trees that pushes randomisation further than Random Forest. Both the candidate features and the split thresholds are chosen completely at random at each node, eliminating the greedy search over thresholds. This extra randomness reduces variance, often matches or exceeds Random Forest accuracy, and runs substantially faster at training time.