ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

درخت تصمیم×LIME: توضیحات قابل تفسیر محلی و مستقل از مدل×جنگل تصادفی×
حوزهیادگیری ماشینیادگیری ماشینیادگیری ماشین
خانوادهMachine learningMachine learningMachine learning
سال پیدایش198420162001
پدیدآورBreiman, Friedman, Olshen & StoneMarco Ribeiro, Sameer Singh & Carlos GuestrinBreiman, L.
نوعRecursive partitioning (if-then rules)post-hoc local explanationEnsemble (bagging of decision trees)
منبع بنیادینBreiman, 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 ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
نام‌های دیگرKarar 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çıklamalarRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
مرتبط524
خلاصه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.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.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.
ScholarGateمجموعه‌داده
  1. v1
  2. 1 منابع
  3. PUBLISHED
  1. v1
  2. 1 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED

رفتن به جست‌وجو دریافت اسلایدها

ScholarGateمقایسهٔ روش‌ها: Decision Tree · LIME · Random Forest. بازیابی‌شده در 2026-06-19 از https://scholargate.app/fa/compare