ScholarGate
助手

方法对比

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

Bagging(Bootstrap Aggregating)×Boosting×稳健自举聚合×
领域机器学习机器学习机器学习
方法族Machine learningMachine learningMachine learning
起源年份19961990–19971996–2000s
提出者Breiman, L.Schapire, R. E.; Freund, Y.Breiman, L. (bagging); robust variants developed by various authors in 2000s
类型Ensemble meta-algorithm (variance reduction via bootstrap aggregation)Sequential ensemble (iterative reweighting)Ensemble (robust bootstrap aggregating)
开创性文献Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. 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 ↗Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123–140. DOI ↗
别名Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictorAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemblerobust bootstrap aggregating, robust ensemble bagging, outlier-resistant bagging, robust BAGGing
相关566
摘要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.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.Robust Bagging extends the classic Bootstrap Aggregating (Bagging) framework by replacing or augmenting standard base learners with robust estimators — or by using robust aggregation rules — so that the ensemble remains accurate even when training data contain outliers, mislabelled instances, or heavy-tailed noise distributions.
ScholarGate数据集
  1. v1
  2. 3 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Bagging · Boosting · Robust Bagging. 于 2026-06-20 检索自 https://scholargate.app/zh/compare