方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 稳健自举聚合× | 随机森林× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1996–2000s | 2001 |
| 提出者≠ | Breiman, L. (bagging); robust variants developed by various authors in 2000s | Breiman, L. |
| 类型≠ | Ensemble (robust bootstrap aggregating) | Ensemble (bagging of decision trees) |
| 开创性文献≠ | Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123–140. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 别名 | robust bootstrap aggregating, robust ensemble bagging, outlier-resistant bagging, robust BAGGing | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 相关≠ | 6 | 4 |
| 摘要≠ | 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. | 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. |
| ScholarGate数据集 ↗ |
|
|