방법 비교

	배깅 (Bootstrap Aggregating)	온라인 부스팅	랜덤 포레스트
분야	머신러닝	머신러닝	머신러닝
계열	Machine learning	Machine learning	Machine learning
기원 연도	1996	2001	2001
창시자	Breiman, L.	Oza, N. C. & Russell, S.	Breiman, L.
유형	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)	Online ensemble (incremental boosting)	Ensemble (bagging of decision trees)
원전	Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140.	Oza, N. C., & Russell, S. (2001). Online Bagging and Boosting. In Artificial Intelligence and Statistics 2001 (pp. 105–112). Morgan Kaufmann.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
별칭	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor	streaming boosting, incremental boosting, online AdaBoost, online ensemble boosting	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
관련	5	6	4
요약	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.	Online Boosting adapts the classical boosting framework to data streams, updating an ensemble of weak learners one example at a time without storing the full dataset. The Oza-Russell formulation approximates AdaBoost's reweighting using Poisson-sampled instance counts, enabling accurate, adaptive classification in real-time or resource-constrained environments.	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.