ScholarGate
助手

方法对比

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

Boosting Ensemble×AdaBoost×梯度提升(Gradient Boosting)×
领域集成学习机器学习机器学习
方法族Machine learningMachine learningMachine learning
起源年份199019972001
提出者Robert SchapireFreund, Y. & Schapire, R.E.Friedman, J. H.
类型sequential ensembleEnsemble (sequential boosting of weak learners)Ensemble (sequential boosting of decision trees)
开创性文献Schapire, R. E. (1990). The strength of weak learnability. Machine Learning, 5(2), 197-227. DOI ↗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 ↗
别名adaptive boosting, sequential ensembleAdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırmaGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
相关455
摘要Boosting is an ensemble method that sequentially trains weak learners and combines them into a strong predictor by focusing on samples that previous models misclassified. Each new weak learner is weighted according to the difficulty of its training task, and final predictions are made via weighted voting. Pioneered by Schapire (1990) and refined in AdaBoost (Freund & Schapire, 1997), boosting converts weak learners (barely better than random) into strong learners through sequential reweighting.AdaBoost (Adaptive Boosting) is the original boosting algorithm, introduced by Yoav Freund and Robert Schapire in 1997, that combines a sequence of simple weak learners by giving more weight to the observations they get wrong. The forerunner of gradient boosting, it is simple, interpretable, and a strong baseline for classification.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. 1 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED

前往搜索 下载幻灯片

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