Compară metode

	Extra Trees Explicabile	Arbore de decizie	Extra Trees
Domeniu	Învățare automată	Învățare automată	Învățare automată
Familie	Machine learning	Machine learning	Machine learning
Anul apariției	2006 (Extra Trees); 2017 (SHAP integration)	1984	2006
Autorul original	Geurts, P., Ernst, D., Wehenkel, L. (Extra Trees); Lundberg, S. M. (SHAP explainability layer)	Breiman, Friedman, Olshen & Stone	Geurts, P.; Ernst, D.; Wehenkel, L.
Tip	Ensemble (randomized trees) with post-hoc explainability	Recursive partitioning (if-then rules)	Ensemble (extremely randomized decision trees)
Sursa seminală	Geurts, P., Ernst, D., & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42.	Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth.	Geurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42.
Denumiri alternative	XAI-ET, Explainable ET, Interpretable Extra Trees, Extra Trees with SHAP	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree	Extremely Randomized Trees, ExtraTreesClassifier, ExtraTreesRegressor, ET
Înrudite	5	5	5
Rezumat	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.	Extra Trees (Extremely Randomized Trees), introduced by Geurts, Ernst, and Wehenkel in 2006, is an ensemble of decision trees that pushes randomisation further than Random Forest. Both the candidate features and the split thresholds are chosen completely at random at each node, eliminating the greedy search over thresholds. This extra randomness reduces variance, often matches or exceeds Random Forest accuracy, and runs substantially faster at training time.