ScholarGate
Asistent

Usporedite metode

Pregledajte odabrane metode jednu uz drugu; retci koji se razlikuju su istaknuti.

Objašnjivi LightGBM×Stablo odlučivanja×
PodručjeStrojno učenjeStrojno učenje
ObiteljMachine learningMachine learning
Godina nastanka20171984
TvoracKe, G. et al. (LightGBM); Lundberg, S. M. & Lee, S.-I. (SHAP for tree models)Breiman, Friedman, Olshen & Stone
VrstaGradient boosting with post-hoc explainability (SHAP)Recursive partitioning (if-then rules)
Temeljni izvorLundberg, 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 ↗
Drugi naziviXAI-LightGBM, LightGBM with SHAP, Interpretable LightGBM, LightGBM explainabilityKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree
Srodne65
SažetakExplainable LightGBM combines Microsoft's LightGBM gradient boosting framework with SHAP (SHapley Additive exPlanations) to deliver both high predictive performance and rigorous, theoretically grounded feature-level explanations. It is widely adopted in applied research where predictive accuracy and interpretability are simultaneously required.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.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 1 Izvori
  3. PUBLISHED

Idi na pretraživanje Preuzmi prezentaciju

ScholarGateUsporedite metode: Explainable LightGBM · Decision Tree. Preuzeto 2026-06-17 s https://scholargate.app/hr/compare