방법 비교

	배깅 앙상블	부스팅 앙상블	랜덤 포레스트
분야	앙상블 학습	앙상블 학습	머신러닝
계열	Machine learning	Machine learning	Machine learning
기원 연도	1996	1990	2001
창시자	Leo Breiman	Robert Schapire	Breiman, L.
유형	parallel ensemble	sequential ensemble	Ensemble (bagging of decision trees)
원전	Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123-140.	Schapire, R. E. (1990). The strength of weak learnability. Machine Learning, 5(2), 197-227.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
별칭	bootstrap aggregating	adaptive boosting, sequential ensemble	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
관련	4	4	4
요약	Bagging, short for bootstrap aggregating, is an ensemble method that reduces variance by training multiple copies of a single learning algorithm on different random subsets of the training data. Each subset is created via bootstrap sampling—randomly drawing samples with replacement. Predictions are combined through majority voting (classification) or averaging (regression). Introduced by Leo Breiman in 1996, bagging forms the foundation for random forests and is particularly effective for reducing overfitting in high-variance models.	Boosting is an ensemble method that sequentially trains weak learners and combines them into a strong predictor by focusing on samples that previous models misclassified. Each new weak learner is weighted according to the difficulty of its training task, and final predictions are made via weighted voting. Pioneered by Schapire (1990) and refined in AdaBoost (Freund & Schapire, 1997), boosting converts weak learners (barely better than random) into strong learners through sequential reweighting.	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.