ScholarGate
सहायक

विधियों की तुलना करें

चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।

व्याख्या योग्य एक्स्ट्रा ट्रीज़×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-17 को यहाँ से प्राप्त https://scholargate.app/hi/compare