방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 설명 가능한 서포트 벡터 머신(Explainable Support Vector Machine)× | Explainable Random Forest× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | 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데이터셋 ↗ |
|
|