ScholarGate
助手

方法对比

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

AdaBoost×装袋集成×梯度提升(Gradient Boosting)×
领域机器学习集成学习机器学习
方法族Machine learningMachine learningMachine learning
起源年份199719962001
提出者Freund, Y. & Schapire, R.E.Leo BreimanFriedman, J. H.
类型Ensemble (sequential boosting of weak learners)parallel ensembleEnsemble (sequential boosting of 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. DOI ↗Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123-140. DOI ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗
别名AdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırmabootstrap aggregatingGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
相关545
摘要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.Bagging, short for bootstrap aggregating, is an ensemble method that reduces variance by training multiple copies of a single learning algorithm on different random subsets of the training data. Each subset is created via bootstrap sampling—randomly drawing samples with replacement. Predictions are combined through majority voting (classification) or averaging (regression). Introduced by Leo Breiman in 1996, bagging forms the foundation for random forests and is particularly effective for reducing overfitting in high-variance models.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. 1 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED

前往搜索 下载幻灯片

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