Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Pădurea Aleatorie Explicabilă× | Pădurea Aleatoare (Random Forest)× | XGBoost× | |
|---|---|---|---|
| Domeniu | Învățare automată | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning | Machine learning |
| Anul apariției≠ | 2001–2017 | 2001 | 2016 |
| Autorul original≠ | Breiman, L. (RF); Lundberg & Lee (SHAP attribution) | Breiman, L. | Chen, T. & Guestrin, C. |
| Tip≠ | Interpretable ensemble (bagging + post-hoc attribution) | Ensemble (bagging of decision trees) | Ensemble (gradient-boosted decision trees) |
| Sursa seminală≠ | 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 ↗ | Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗ |
| Denumiri alternative≠ | XRF, interpretable random forest, transparent random forest, random forest with explainability | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble | XGBoost, extreme gradient boosting, scalable tree boosting |
| Înrudite≠ | 4 | 4 | 5 |
| Rezumat≠ | 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. | 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. |
| ScholarGateSet de date ↗ |
|
|
|