ScholarGate
助手

方法对比

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

鲁棒投票集成×随机森林×稳健自举聚合×
领域机器学习机器学习机器学习
方法族Machine learningMachine learningMachine learning
起源年份2000s–2010s20011996–2000s
提出者Dietterich, T. G. (ensemble voting foundations); robustification extensions developed broadly in the ML communityBreiman, L.Breiman, L. (bagging); robust variants developed by various authors in 2000s
类型Robust ensemble aggregationEnsemble (bagging of decision trees)Ensemble (robust bootstrap aggregating)
开创性文献Dietterich, T. G. (2000). Ensemble methods in machine learning. In J. Kittler & F. Roli (Eds.), Multiple Classifier Systems, LNCS 1857, 1–15. Springer. DOI ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123–140. DOI ↗
别名robust majority voting, robust vote aggregation, noise-tolerant voting ensemble, fault-tolerant classifier combinationRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemblerobust bootstrap aggregating, robust ensemble bagging, outlier-resistant bagging, robust BAGGing
相关646
摘要Robust Voting Ensemble combines predictions from multiple base classifiers using noise-tolerant aggregation — such as weighted voting, trimmed voting, or median-based combination — to produce final decisions that remain reliable when individual classifiers are corrupted by noisy labels, adversarial inputs, or distributional shift.Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.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. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

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