방법 비교

	Robust Bagging	부스팅	랜덤 포레스트	로버스트 부스팅(Robust Boosting)
분야	머신러닝	머신러닝	머신러닝	머신러닝
계열	Machine learning	Machine learning	Machine learning	Machine learning
기원 연도	1996–2000s	1990–1997	2001	1999–2001
창시자	Breiman, L. (bagging); robust variants developed by various authors in 2000s	Schapire, R. E.; Freund, Y.	Breiman, L.	Freund, Y.; Mason, L. et al.
유형	Ensemble (robust bootstrap aggregating)	Sequential ensemble (iterative reweighting)	Ensemble (bagging of decision trees)	Ensemble (robust sequential boosting)
원전	Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123–140.	Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.	Freund, Y. (2001). An adaptive version of the boost by majority algorithm. Machine Learning, 43(3), 293–318.
별칭	robust bootstrap aggregating, robust ensemble bagging, outlier-resistant bagging, robust BAGGing	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble	noise-tolerant boosting, robust AdaBoost, boosting with robust losses, outlier-resistant boosting
관련	6	6	4	6
요약	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.	Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy.	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 Boosting modifies standard boosting algorithms — such as AdaBoost or gradient boosting — by replacing the default exponential or squared loss with robust loss functions (e.g., Huber, logistic, or truncated losses) or by incorporating noise-tolerance mechanisms, so that the ensemble remains accurate even when training data contain outliers, label noise, or heavy-tailed errors.