השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| מכונת וקטורים תומכים ניתנת להסבר× | יער אקראי מוסבר (Explainable Random Forest - XRF)× | |
|---|---|---|
| תחום | למידת מכונה | למידת מכונה |
| משפחה | Machine learning | Machine learning |
| שנת המקור≠ | 2016–2017 (XAI layer) | 2001–2017 |
| הוגה השיטה≠ | Cortes & Vapnik (SVM); explainability layer via Lundberg & Lee (SHAP, 2017) and Ribeiro et al. (LIME, 2016) | Breiman, L. (RF); Lundberg & Lee (SHAP attribution) |
| סוג≠ | Post-hoc explainability applied to SVM | Interpretable ensemble (bagging + post-hoc attribution) |
| מקור מכונן≠ | Lundberg, S. M., & Lee, S. I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 4765–4774. link ↗ | Lundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 4765–4774. link ↗ |
| כינויים | Explainable SVM, Interpretable SVM, XAI-SVM, Transparent Support Vector Machine | XRF, interpretable random forest, transparent random forest, random forest with explainability |
| קשורות | 4 | 4 |
| תקציר≠ | Explainable SVM combines a trained Support Vector Machine with a post-hoc interpretability layer — typically SHAP or LIME — to produce feature-level explanations for individual predictions and global importance rankings. It retains the discriminative power of SVM while meeting transparency requirements in high-stakes domains such as medicine, finance, and law. | Explainable 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. |
| ScholarGateמערך נתונים ↗ |
|
|