ScholarGate
Assistant

Comparer des méthodes

Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.

XGBoost Explicable×Forêt Aléatoire×
DomaineApprentissage automatiqueApprentissage automatique
FamilleMachine learningMachine learning
Année d'origine2016–20202001
Auteur d'origineChen & Guestrin (XGBoost); Lundberg & Lee (SHAP for trees)Breiman, L.
TypeInterpretable ensemble (gradient-boosted trees + SHAP)Ensemble (bagging of decision trees)
Source fondatriceLundberg, S. M., Erion, G., Chen, H., DeGrave, A., Prutkin, J. M., Nair, B., Katz, R., Himmelfarb, J., Bansal, N., & Lee, S.-I. (2020). From local explanations to global understanding with explainable AI for trees. Nature Machine Intelligence, 2(1), 56–67. DOI ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
AliasXGBoost + SHAP, interpretable XGBoost, XAI-XGBoost, transparent gradient boostingRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Apparentées64
RésuméExplainable XGBoost pairs the high predictive accuracy of XGBoost gradient-boosted trees with SHAP (SHapley Additive exPlanations) values to make each prediction fully auditable. The result is a model that matches or surpasses neural networks on tabular data while offering theoretically grounded, per-prediction feature attributions that satisfy both scientific transparency and regulatory demands.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.
ScholarGateJeu de données
  1. v1
  2. 2 Sources
  3. PUBLISHED
  1. v1
  2. 2 Sources
  3. PUBLISHED

Aller à la recherche Télécharger les diapositives

ScholarGateComparer des méthodes: Explainable XGBoost · Random Forest. Consulté le 2026-06-17 sur https://scholargate.app/fr/compare