方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 鲁棒随机森林× | Bagging（Bootstrap Aggregating）× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2000s–2010s | 1996 |
| 提出者≠ | Various (extensions of Breiman 2001 Random Forest) | Breiman, L. |
| 类型≠ | Robust Ensemble (noise-tolerant bagging of decision trees) | Ensemble meta-algorithm (variance reduction via bootstrap aggregation) |
| 开创性文献≠ | 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 ↗ | Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗ |
| 别名≠ | RRF, noise-robust random forest, outlier-resistant random forest, robust ensemble forest | Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor |
| 相关≠ | 6 | 5 |
| 摘要≠ | 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. | 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数据集 ↗ |
|
|