ScholarGate
Asistent

Porovnat metody

Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.

Vysvětlitelné extrémní náhodné stromy×Rozhodovací strom×Random Forest×
OborStrojové učeníStrojové učeníStrojové učení
RodinaMachine learningMachine learningMachine learning
Rok vzniku2006 (Extra Trees); 2017 (SHAP integration)19842001
TvůrceGeurts, P., Ernst, D., Wehenkel, L. (Extra Trees); Lundberg, S. M. (SHAP explainability layer)Breiman, Friedman, Olshen & StoneBreiman, L.
TypEnsemble (randomized trees) with post-hoc explainabilityRecursive partitioning (if-then rules)Ensemble (bagging of decision trees)
Původní zdrojGeurts, P., Ernst, D., & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42. DOI ↗Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
Další názvyXAI-ET, Explainable ET, Interpretable Extra Trees, Extra Trees with SHAPKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Příbuzné554
Shrnutí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.A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.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.
ScholarGateDatová sada
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 1 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED

Přejít na hledání Stáhnout prezentaci

ScholarGatePorovnat metody: Explainable Extra Trees · Decision Tree · Random Forest. Získáno 2026-06-17 z https://scholargate.app/cs/compare