Methoden vergelijken
Bekijk de geselecteerde methoden naast elkaar; rijen die verschillen zijn gemarkeerd.
| Uitlegbare Random Forest× | Gradient Boosting× | XGBoost× | |
|---|---|---|---|
| Vakgebied | Machine learning | Machine learning | Machine learning |
| Familie | Machine learning | Machine learning | Machine learning |
| Jaar van ontstaan≠ | 2001–2017 | 2001 | 2016 |
| Grondlegger≠ | Breiman, L. (RF); Lundberg & Lee (SHAP attribution) | Friedman, J. H. | Chen, T. & Guestrin, C. |
| Type≠ | Interpretable ensemble (bagging + post-hoc attribution) | Ensemble (sequential boosting of decision trees) | Ensemble (gradient-boosted decision trees) |
| Oorspronkelijke bron≠ | Lundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 4765–4774. link ↗ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ | Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗ |
| Aliassen≠ | XRF, interpretable random forest, transparent random forest, random forest with explainability | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine | XGBoost, extreme gradient boosting, scalable tree boosting |
| Verwant≠ | 4 | 5 | 5 |
| Samenvatting≠ | 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. | 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. | XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions. |
| ScholarGateGegevensset ↗ |
|
|
|