방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 설명 가능한 K-최근접 이웃 (Explainable K-Nearest Neighbors, XKNN)× | 결정 트리× | LIME: Local Interpretable Model-agnostic Explanations× | 나이브 베이즈× | |
|---|---|---|---|---|
| 분야 | 머신러닝 | 머신러닝 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning | Machine learning | Machine learning |
| 기원 연도≠ | 1967 (KNN); 2010s (explainability extensions) | 1984 | 2016 | 1997 |
| 창시자≠ | Cover, T. & Hart, P. (KNN); XAI extensions by various authors | Breiman, Friedman, Olshen & Stone | Marco Ribeiro, Sameer Singh & Carlos Guestrin | Mitchell, T. M. (textbook treatment) |
| 유형≠ | Instance-based learning with explainability layer | Recursive partitioning (if-then rules) | post-hoc local explanation | Probabilistic classifier (Bayes' theorem with conditional independence) |
| 원전≠ | Cover, T. & Hart, P. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13(1), 21–27. DOI ↗ | 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 ↗ | Mitchell, T. M. (1997). Machine Learning. McGraw-Hill. ISBN: 978-0070428072 |
| 별칭≠ | XKNN, Interpretable KNN, Explainable KNN, Transparent K-Nearest Neighbors | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree | Local Surrogate Explanations, Model-Agnostic Local Explanations, Locally Faithful Approximations, Yerel Yorumlanabilir Model-Bağımsız Açıklamalar | Naive Bayes Sınıflandırıcı, naive bayes classifier, simple Bayes, Gaussian Naive Bayes |
| 관련≠ | 4 | 5 | 2 | 4 |
| 요약≠ | Explainable K-Nearest Neighbors (XKNN) augments the classic KNN classifier or regressor with structured post-hoc or built-in explanation mechanisms, exposing which retrieved neighbors, which features, and which distance contributions drive each individual prediction — making the model's reasoning transparent and auditable for human decision-makers. | 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. | Naive Bayes is a fast probabilistic classifier that applies Bayes' theorem while assuming that the features are conditionally independent given the class — a method given its standard machine-learning treatment in Tom Mitchell's 1997 textbook Machine Learning. Despite this simplifying ('naive') assumption, it is quick to train and often surprisingly accurate. |
| ScholarGate데이터셋 ↗ |
|
|
|
|