পদ্ধতির তুলনা করুন

	অনলাইন ভোটিং এনসেম্বল	অনলাইন বুস্টিং
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	2001–2009	2001
প্রবর্তক	Oza, N. C. & Russell, S.; extended by Bifet et al.	Oza, N. C. & Russell, S.
ধরন	Online ensemble (incremental majority vote)	Online ensemble (incremental boosting)
মৌলিক উৎস	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.
অপর নাম	streaming voting ensemble, incremental voting ensemble, online majority-vote ensemble, data-stream voting classifier	streaming boosting, incremental boosting, online AdaBoost, online ensemble boosting
সম্পর্কিত	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 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.