方法对比

	Boosting	在线学习	在线随机森林
领域	机器学习	机器学习	机器学习
方法族	Machine learning	Machine learning	Machine learning
起源年份	1990–1997	1958–2000s	2009
提出者	Schapire, R. E.; Freund, Y.	Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors)	Saffari, A. et al.
类型	Sequential ensemble (iterative reweighting)	Learning paradigm (sequential model update)	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.	Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194.	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	incremental learning, sequential learning, streaming learning, online machine learning	ORF, streaming random forest, incremental random forest, adaptive random forest
相关	6	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 learning is a machine learning paradigm in which a model is updated incrementally as each new data point arrives, rather than being trained once on a fixed dataset. It is essential when data streams continuously, storage is limited, or the underlying distribution shifts over time. Theoretical performance is measured by cumulative regret relative to the best fixed predictor in hindsight.	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.