ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

الشرحيات المتطرفة (Explainable Extra Trees)×XGBoost×
المجالتعلم الآلةتعلم الآلة
العائلةMachine learningMachine learning
سنة النشأة2006 (Extra Trees); 2017 (SHAP integration)2016
صاحب الطريقةGeurts, P., Ernst, D., Wehenkel, L. (Extra Trees); Lundberg, S. M. (SHAP explainability layer)Chen, T. & Guestrin, C.
النوعEnsemble (randomized trees) with post-hoc explainabilityEnsemble (gradient-boosted decision trees)
المصدر التأسيسيGeurts, P., Ernst, D., & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42. DOI ↗Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗
الأسماء البديلةXAI-ET, Explainable ET, Interpretable Extra Trees, Extra Trees with SHAPXGBoost, extreme gradient boosting, scalable tree boosting
ذات صلة55
الملخص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.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.
ScholarGateمجموعة البيانات
  1. v1
  2. 2 المصادر
  3. PUBLISHED
  1. v1
  2. 1 المصادر
  3. PUBLISHED

انتقل إلى البحث تنزيل الشرائح

ScholarGateقارن الطرق: Explainable Extra Trees · XGBoost. استُرجع بتاريخ 2026-06-15 من https://scholargate.app/ar/compare