Sammenlign metoder
Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.
| Explainable Random Forest× | Random Forest× | |
|---|---|---|
| Fagfelt | Maskinlæring | Maskinlæring |
| Familie | Machine learning | Machine learning |
| Opprinnelsesår≠ | 2001–2017 | 2001 |
| Opphavsperson≠ | Breiman, L. (RF); Lundberg & Lee (SHAP attribution) | Breiman, L. |
| Type≠ | Interpretable ensemble (bagging + post-hoc attribution) | Ensemble (bagging of decision trees) |
| Opprinnelig kilde≠ | Lundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 4765–4774. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Alias | XRF, interpretable random forest, transparent random forest, random forest with explainability | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Relaterte | 4 | 4 |
| Sammendrag≠ | Explainable Random Forest (XRF) combines the predictive power of Breiman's Random Forest ensemble with systematic post-hoc attribution methods — principally SHAP values and mean-decrease-in-impurity importance — to make model decisions transparent and auditable. It delivers both high accuracy and human-interpretable feature contributions, satisfying demands from regulators, domain experts, and academic reviewers alike. | 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. |
| ScholarGateDatasett ↗ |
|
|