Comparer des méthodes

	Forêt Aléatoire	Robust Bagging
Domaine	Apprentissage automatique	Apprentissage automatique
Famille	Machine learning	Machine learning
Année d'origine	2001	1996–2000s
Auteur d'origine	Breiman, L.	Breiman, L. (bagging); robust variants developed by various authors in 2000s
Type	Ensemble (bagging of decision trees)	Ensemble (robust bootstrap aggregating)
Source fondatrice	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.	Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123–140.
Alias	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble	robust bootstrap aggregating, robust ensemble bagging, outlier-resistant bagging, robust BAGGing
Apparentées	4	6
Résumé	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.	Robust Bagging extends the classic Bootstrap Aggregating (Bagging) framework by replacing or augmenting standard base learners with robust estimators — or by using robust aggregation rules — so that the ensemble remains accurate even when training data contain outliers, mislabelled instances, or heavy-tailed noise distributions.