ScholarGate
Assistent

Methoden vergelijken

Bekijk de geselecteerde methoden naast elkaar; rijen die verschillen zijn gemarkeerd.

Uitlegbare Random Forest×Beslisboom×Random Forest×
VakgebiedMachine learningMachine learningMachine learning
FamilieMachine learningMachine learningMachine learning
Jaar van ontstaan2001–201719842001
GrondleggerBreiman, L. (RF); Lundberg & Lee (SHAP attribution)Breiman, Friedman, Olshen & StoneBreiman, L.
TypeInterpretable ensemble (bagging + post-hoc attribution)Recursive partitioning (if-then rules)Ensemble (bagging of decision trees)
Oorspronkelijke bronLundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 4765–4774. link ↗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 ↗
AliassenXRF, interpretable random forest, transparent random forest, random forest with explainabilityKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Verwant454
SamenvattingExplainable Random Forest (XRF) combines the predictive power of Breiman's Random Forest ensemble with systematic post-hoc attribution methods — principally SHAP values and mean-decrease-in-impurity importance — to make model decisions transparent and auditable. It delivers both high accuracy and human-interpretable feature contributions, satisfying demands from regulators, domain experts, and academic reviewers alike.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.
ScholarGateGegevensset
  1. v1
  2. 2 Bronnen
  3. PUBLISHED
  1. v1
  2. 1 Bronnen
  3. PUBLISHED
  1. v1
  2. 2 Bronnen
  3. PUBLISHED

Naar zoeken Dia's downloaden

ScholarGateMethoden vergelijken: Explainable Random Forest · Decision Tree · Random Forest. Geraadpleegd op 2026-06-18 via https://scholargate.app/nl/compare