방법 비교

	온라인 배깅	그래디언트 부스팅	온라인 부스팅	랜덤 포레스트
분야	머신러닝	머신러닝	머신러닝	머신러닝
계열	Machine learning	Machine learning	Machine learning	Machine learning
기원 연도	2001	2001	2001	2001
창시자	Oza, N. C. & Russell, S.	Friedman, J. H.	Oza, N. C. & Russell, S.	Breiman, L.
유형	Online ensemble (streaming bagging)	Ensemble (sequential boosting of decision trees)	Online ensemble (incremental boosting)	Ensemble (bagging of decision trees)
원전	Oza, N. C., & Russell, S. (2001). Online bagging and boosting. In Proceedings of the Eighth International Workshop on Artificial Intelligence and Statistics (AISTATS 2001), pp. 105–112.	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.	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.
별칭	incremental bagging, streaming bagging, online bootstrap aggregating, OzaBag	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine	streaming boosting, incremental boosting, online AdaBoost, online ensemble boosting	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
관련	4	5	6	4
요약	Online Bagging is a streaming ensemble method introduced by Oza and Russell in 2001 that adapts the classical bootstrap aggregating (Bagging) framework to the online learning setting. Instead of resampling a fixed dataset, each incoming instance is fed to every base learner a Poisson(1)-distributed number of times, faithfully approximating bootstrap sampling as the stream evolves. The result is a robust, incrementally updated ensemble that can handle concept drift and continuous data arrival without storing the entire dataset.	Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.	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.