手法を比較

	アンサンブルオンライン学習	アクティブラーニング	オンライン学習	ランダムフォレスト
分野	機械学習	機械学習	機械学習	機械学習
系統	Machine learning	Machine learning	Machine learning	Machine learning
提唱年	2001	2009	1958–2000s	2001
提唱者	Oza, N. C. & Russell, S.	Burr Settles	Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors)	Breiman, L.
種類	Ensemble (online / incremental)	Interactive supervised learning framework	Learning paradigm (sequential model update)	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. 229–236.	Settles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648.	Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
別名	online ensemble methods, streaming ensemble learning, incremental ensemble learning, adaptive ensemble learning	Query Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif Öğrenme	incremental learning, sequential learning, streaming learning, online machine learning	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
関連	6	2	6	4
概要	Ensemble Online Learning combines multiple base learners that are trained incrementally on a stream of data, updating each model one observation at a time. By aggregating the predictions of diverse online learners, the ensemble achieves accuracy and robustness that surpass any single incremental model, while adapting continuously to changing data distributions.	Active learning is an iterative machine-learning paradigm in which a learning algorithm selectively queries an oracle — typically a human annotator — for labels on the most informative unlabeled examples. Formalized by Burr Settles in his seminal 2009 literature survey, active learning addresses the practical bottleneck of annotation cost by achieving high model accuracy with far fewer labeled examples than passive supervised learning requires.	Online learning is a machine learning paradigm in which a model is updated incrementally as each new data point arrives, rather than being trained once on a fixed dataset. It is essential when data streams continuously, storage is limited, or the underlying distribution shifts over time. Theoretical performance is measured by cumulative regret relative to the best fixed predictor in hindsight.	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.