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

	বুস্টিং	Online Random Forest
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	1990–1997	2009
প্রবর্তক	Schapire, R. E.; Freund, Y.	Saffari, A. et al.
ধরন	Sequential ensemble (iterative reweighting)	Incremental ensemble (streaming decision trees)
মৌলিক উৎস	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.	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.
অপর নাম	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	ORF, streaming random forest, incremental random forest, adaptive random forest
সম্পর্কিত	6	6
সারসংক্ষেপ	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.	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.