ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

在线提升 (Online Boosting)×Boosting×梯度提升(Gradient Boosting)×
领域机器学习机器学习机器学习
方法族Machine learningMachine learningMachine learning
起源年份20011990–19972001
提出者Oza, N. C. & Russell, S.Schapire, R. E.; Freund, Y.Friedman, J. H.
类型Online ensemble (incremental boosting)Sequential ensemble (iterative reweighting)Ensemble (sequential boosting of decision trees)
开创性文献Oza, N. C., & Russell, S. (2001). Online Bagging and Boosting. In Artificial Intelligence and Statistics 2001 (pp. 105–112). Morgan Kaufmann. link ↗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. DOI ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗
别名streaming boosting, incremental boosting, online AdaBoost, online ensemble boostingAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensembleGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
相关665
摘要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.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.Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Online Boosting · Boosting · Gradient Boosting. 于 2026-06-18 检索自 https://scholargate.app/zh/compare