ScholarGate
助手

方法对比

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

鲁棒堆叠集成×Bagging(Bootstrap Aggregating)×
领域机器学习机器学习
方法族Machine learningMachine learning
起源年份1992 (stacking); robust variants 2000s–present1996
提出者Wolpert, D. H. (stacking); robust extensions by multiple authorsBreiman, L.
类型Ensemble (stacking with robust meta-learner)Ensemble meta-algorithm (variance reduction via bootstrap aggregation)
开创性文献Wolpert, D. H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259. DOI ↗Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗
别名robust stacking, robust stacked generalization, outlier-resistant stacking, stacking with robust meta-learnerBootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor
相关55
摘要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.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.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 3 来源
  3. PUBLISHED

前往搜索 下载幻灯片

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