ScholarGate
助手

方法对比

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

鲁棒堆叠集成×Boosting×
领域机器学习机器学习
方法族Machine learningMachine learning
起源年份1992 (stacking); robust variants 2000s–present1990–1997
提出者Wolpert, D. H. (stacking); robust extensions by multiple authorsSchapire, R. E.; Freund, Y.
类型Ensemble (stacking with robust meta-learner)Sequential ensemble (iterative reweighting)
开创性文献Wolpert, D. H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259. 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 ↗
别名robust stacking, robust stacked generalization, outlier-resistant stacking, stacking with robust meta-learnerAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
相关56
摘要Robust Stacking Ensemble extends classical stacked generalization by replacing the ordinary meta-learner with a robust estimator — such as a Huber-loss regressor, quantile regression, or a model trained on trimmed residuals — so that the ensemble's combination layer is resistant to outliers and noisy base-learner predictions. It improves predictive accuracy and reliability on real-world datasets with contaminated labels or heavy-tailed error distributions.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.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

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