방법 비교

	Robust Bagging	랜덤 포레스트
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	1996–2000s	2001
창시자	Breiman, L. (bagging); robust variants developed by various authors in 2000s	Breiman, L.
유형	Ensemble (robust bootstrap aggregating)	Ensemble (bagging of decision trees)
원전	Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123–140.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
별칭	robust bootstrap aggregating, robust ensemble bagging, outlier-resistant bagging, robust BAGGing	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
관련	6	4
요약	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.	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.