方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| Bagging（Bootstrap Aggregating）× | 在线提升 (Online Boosting)× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1996 | 2001 |
| 提出者≠ | Breiman, L. | Oza, N. C. & Russell, S. |
| 类型≠ | Ensemble meta-algorithm (variance reduction via bootstrap aggregation) | Online ensemble (incremental boosting) |
| 开创性文献≠ | Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗ | Oza, N. C., & Russell, S. (2001). Online Bagging and Boosting. In Artificial Intelligence and Statistics 2001 (pp. 105–112). Morgan Kaufmann. link ↗ |
| 别名≠ | Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor | streaming boosting, incremental boosting, online AdaBoost, online ensemble boosting |
| 相关≠ | 5 | 6 |
| 摘要≠ | Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner. | 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. |
| ScholarGate数据集 ↗ |
|
|