ScholarGate
Assistent

Võrdle meetodeid

Vaata valitud meetodeid kõrvuti; erinevad read on esile tõstetud.

Otsustuspuu×LIME: Kohalikud tõlgendatavad mudelist-agnostilised selgitused×
ValdkondMasinõpeMasinõpe
PerekondMachine learningMachine learning
Tekkeaasta19842016
LoojaBreiman, Friedman, Olshen & StoneMarco Ribeiro, Sameer Singh & Carlos Guestrin
TüüpRecursive partitioning (if-then rules)post-hoc local explanation
AlgallikasBreiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗Ribeiro, M. T., Singh, S., & Guestrin, C. (2016). "Why should I trust you?": Explaining the predictions of any classifier. ACM SIGKDD, 1135–1144. DOI ↗
RööpnimetusedKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeLocal Surrogate Explanations, Model-Agnostic Local Explanations, Locally Faithful Approximations, Yerel Yorumlanabilir Model-Bağımsız Açıklamalar
Seotud52
KokkuvõteA 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.LIME, introduced by Ribeiro, Singh, and Guestrin in 2016, explains the predictions of any black-box classifier or regressor by building a simple, locally faithful surrogate model around a single prediction of interest. Rather than explaining the global model, LIME focuses on why a specific instance was classified the way it was, making complex models such as deep neural networks and ensemble methods interpretable to end-users, domain experts, and auditors.
ScholarGateAndmestik
  1. v1
  2. 1 Allikad
  3. PUBLISHED
  1. v1
  2. 1 Allikad
  3. PUBLISHED

Mine otsingusse Laadi slaidid alla

ScholarGateVõrdle meetodeid: Decision Tree · LIME. Loetud 2026-06-20 aadressilt https://scholargate.app/et/compare