方法对比

	Boosting	在线Bagging	在线学习
领域	机器学习	机器学习	机器学习
方法族	Machine learning	Machine learning	Machine learning
起源年份	1990–1997	2001	1958–2000s
提出者	Schapire, R. E.; Freund, Y.	Oza, N. C. & Russell, S.	Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors)
类型	Sequential ensemble (iterative reweighting)	Online ensemble (streaming bagging)	Learning paradigm (sequential model update)
开创性文献	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.	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. 105–112.	Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194.
别名	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	incremental bagging, streaming bagging, online bootstrap aggregating, OzaBag	incremental learning, sequential learning, streaming learning, online machine learning
相关	6	4	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 Bagging is a streaming ensemble method introduced by Oza and Russell in 2001 that adapts the classical bootstrap aggregating (Bagging) framework to the online learning setting. Instead of resampling a fixed dataset, each incoming instance is fed to every base learner a Poisson(1)-distributed number of times, faithfully approximating bootstrap sampling as the stream evolves. The result is a robust, incrementally updated ensemble that can handle concept drift and continuous data arrival without storing the entire dataset.	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.