Machine learningMachine learning

Explainable Extra Trees

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.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Geurts, P., Ernst, D., & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42. DOI: 10.1007/s10994-006-6226-1
  2. Lundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30. link

Related methods

ScholarGateExplainable Extra Trees (Explainable Extremely Randomized Trees (Extra Trees with Post-Hoc Interpretability)). Retrieved 2026-06-04 from https://scholargate.app/en/machine-learning/explainable-extra-trees