Bandingkan metode

	Ensemble Pemungutan Suara Daring	Peningkatan Daring
Bidang	Pembelajaran Mesin	Pembelajaran Mesin
Keluarga	Machine learning	Machine learning
Tahun asal	2001–2009	2001
Pencetus	Oza, N. C. & Russell, S.; extended by Bifet et al.	Oza, N. C. & Russell, S.
Tipe	Online ensemble (incremental majority vote)	Online ensemble (incremental boosting)
Sumber perintis	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.	Oza, N. C., & Russell, S. (2001). Online Bagging and Boosting. In Artificial Intelligence and Statistics 2001 (pp. 105–112). Morgan Kaufmann.
Alias	streaming voting ensemble, incremental voting ensemble, online majority-vote ensemble, data-stream voting classifier	streaming boosting, incremental boosting, online AdaBoost, online ensemble boosting
Terkait	6	6
Ringkasan	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 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.