方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 鲁棒随机森林× | 梯度提升（Gradient Boosting）× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2000s–2010s | 2001 |
| 提出者≠ | Various (extensions of Breiman 2001 Random Forest) | Friedman, J. H. |
| 类型≠ | Robust Ensemble (noise-tolerant bagging of decision trees) | Ensemble (sequential boosting of decision trees) |
| 开创性文献≠ | 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 ↗ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ |
| 别名 | RRF, noise-robust random forest, outlier-resistant random forest, robust ensemble forest | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine |
| 相关≠ | 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. | Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost. |
| ScholarGate数据集 ↗ |
|
|