Machine learningMachine learning
可解释的极限随机树
可解释的极限随机树（Explainable Extra Trees）结合了极限随机树（Extremely Randomized Trees，简称Extra Trees）集成算法和事后可解释性方法——最常用的是SHAP值——以提供强大的预测性能和透明的特征层面解释。它扩展了经典的Extra Trees分类器或回归器，使得每个预测都可以分解为单个特征的贡献，满足了应用和受监管领域对可解释性的需求。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Geurts, P., Ernst, D., & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42. DOI: 10.1007/s10994-006-6226-1 ↗
- Lundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30. link ↗
如何引用本页
ScholarGate. (2026, June 3). Explainable Extremely Randomized Trees (Extra Trees with Post-Hoc Interpretability). ScholarGate. https://scholargate.app/zh/machine-learning/explainable-extra-trees
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- 决策树机器学习↔ compare
- 极端随机树 (Extra Trees)机器学习↔ compare
- 梯度提升（Gradient Boosting）机器学习↔ compare
- 随机森林机器学习↔ compare
- XGBoost机器学习↔ compare