方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 稳健自举聚合× | 鲁棒随机森林× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1996–2000s | 2000s–2010s |
| 提出者≠ | Breiman, L. (bagging); robust variants developed by various authors in 2000s | Various (extensions of Breiman 2001 Random Forest) |
| 类型≠ | Ensemble (robust bootstrap aggregating) | Robust Ensemble (noise-tolerant bagging of decision trees) |
| 开创性文献≠ | Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123–140. DOI ↗ | Chen, S., & Guestrin, C. (2019). Robust Random Forest. In Proceedings of the 36th International Conference on Machine Learning (ICML). Also see: Gao, W., & Zhou, Z.-H. (2013). On the Doubt about Margin Explanation of Boosting. Artificial Intelligence, 203, 1–18. link ↗ |
| 别名 | robust bootstrap aggregating, robust ensemble bagging, outlier-resistant bagging, robust BAGGing | RRF, noise-robust random forest, outlier-resistant random forest, robust ensemble forest |
| 相关 | 6 | 6 |
| 摘要≠ | 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. | Robust Random Forest extends the standard Random Forest ensemble by incorporating mechanisms that reduce the influence of outliers, label noise, and corrupted observations. Rather than treating all training instances equally, it applies weighting or filtering strategies so that noisy or anomalous samples contribute less to individual tree splits, yielding predictions that remain reliable even when data quality is imperfect. |
| ScholarGate数据集 ↗ |
|
|