Comparer des méthodes

	Online Bagging	Forêt Aléatoire
Domaine	Apprentissage automatique	Apprentissage automatique
Famille	Machine learning	Machine learning
Année d'origine	2001	2001
Auteur d'origine	Oza, N. C. & Russell, S.	Breiman, L.
Type	Online ensemble (streaming bagging)	Ensemble (bagging of decision trees)
Source fondatrice	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.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
Alias	incremental bagging, streaming bagging, online bootstrap aggregating, OzaBag	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Apparentées	4	4
Résumé	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.	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.