Confronta i metodi

	Alberi Extra	Bagging (Bootstrap Aggregating)	Random Forest
Campo	Apprendimento automatico	Apprendimento automatico	Apprendimento automatico
Famiglia	Machine learning	Machine learning	Machine learning
Anno di origine	2006	1996	2001
Ideatore	Geurts, P.; Ernst, D.; Wehenkel, L.	Breiman, L.	Breiman, L.
Tipo	Ensemble (extremely randomized decision trees)	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)	Ensemble (bagging of decision trees)
Fonte seminale	Geurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42.	Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
Alias	Extremely Randomized Trees, ExtraTreesClassifier, ExtraTreesRegressor, ET	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Correlati	5	5	4
Sintesi	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.	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.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.