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

	এনসেম্বল অনলাইন লার্নিং	বুস্টিং	Random Forest
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning	Machine learning
উদ্ভবের বছর	2001	1990–1997	2001
প্রবর্তক	Oza, N. C. & Russell, S.	Schapire, R. E.; Freund, Y.	Breiman, L.
ধরন	Ensemble (online / incremental)	Sequential ensemble (iterative reweighting)	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.	Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
অপর নাম	online ensemble methods, streaming ensemble learning, incremental ensemble learning, adaptive ensemble learning	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
সম্পর্কিত	6	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.	Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy.	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.