방법 비교

	온라인 투표 앙상블	온라인 랜덤 포레스트
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	2001–2009	2009
창시자	Oza, N. C. & Russell, S.; extended by Bifet et al.	Saffari, A. et al.
유형	Online ensemble (incremental majority vote)	Incremental ensemble (streaming 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.	Saffari, A., Leistner, C., Santner, J., Godec, M., & Bischof, H. (2009). On-line random forests. In Proceedings of the 3rd IEEE International Workshop on On-Line Learning for Computer Vision (OLCV 2009), pp. 1–8. IEEE.
별칭	streaming voting ensemble, incremental voting ensemble, online majority-vote ensemble, data-stream voting classifier	ORF, streaming random forest, incremental random forest, adaptive random forest
관련	6	6
요약	Online Voting Ensemble is an incremental ensemble method that maintains a pool of base classifiers — each updated continuously on arriving data — and combines their predictions through a weighted or unweighted majority vote. Designed for data streams, it adapts to non-stationary distributions without retraining from scratch, making it well-suited to real-time classification tasks where data arrives sequentially and concept drift may occur.	Online Random Forest (ORF) extends the classic Random Forest to streaming settings, updating each tree incrementally as new observations arrive without storing or replaying the full training set. Algorithms such as Adaptive Random Forests (ARF) add drift detection so the ensemble adapts when the data distribution changes over time.