方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 可解释的极限随机树× | 随机森林× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2006 (Extra Trees); 2017 (SHAP integration) | 2001 |
| 提出者≠ | Geurts, P., Ernst, D., Wehenkel, L. (Extra Trees); Lundberg, S. M. (SHAP explainability layer) | Breiman, L. |
| 类型≠ | Ensemble (randomized trees) with post-hoc explainability | Ensemble (bagging of decision trees) |
| 开创性文献≠ | Geurts, P., Ernst, D., & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 别名 | XAI-ET, Explainable ET, Interpretable Extra Trees, Extra Trees with SHAP | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 相关≠ | 5 | 4 |
| 摘要≠ | Explainable Extra Trees combines the Extremely Randomized Trees (Extra Trees) ensemble algorithm with post-hoc explainability methods — most commonly SHAP values — to deliver both strong predictive performance and transparent, feature-level explanations. It extends the classic Extra Trees classifier or regressor so that every prediction can be decomposed into individual feature contributions, satisfying demands for accountability in applied and regulated domains. | 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数据集 ↗ |
|
|