방법 비교

	배깅 (Bootstrap Aggregating)	랜덤 포레스트	로버스트 부스팅(Robust Boosting)
분야	머신러닝	머신러닝	머신러닝
계열	Machine learning	Machine learning	Machine learning
기원 연도	1996	2001	1999–2001
창시자	Breiman, L.	Breiman, L.	Freund, Y.; Mason, L. et al.
유형	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)	Ensemble (bagging of decision trees)	Ensemble (robust sequential boosting)
원전	Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140.	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.
별칭	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble	noise-tolerant boosting, robust AdaBoost, boosting with robust losses, outlier-resistant boosting
관련	5	4	6
요약	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.	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.