Uporedite metode

	Objašnjivi K-najbližih suseda	Дрво одлучивања	LIME: Lokalno interpretabilna modelu-agnostička objašnjenja	Naivni Bejz	Slučajna šuma
Oblast	Mašinsko učenje	Mašinsko učenje	Mašinsko učenje	Mašinsko učenje	Mašinsko učenje
Porodica	Machine learning	Machine learning	Machine learning	Machine learning	Machine learning
Godina nastanka	1967 (KNN); 2010s (explainability extensions)	1984	2016	1997	2001
Tvorac	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)	Breiman, L.
Tip	Instance-based learning with explainability layer	Recursive partitioning (if-then rules)	post-hoc local explanation	Probabilistic classifier (Bayes' theorem with conditional independence)	Ensemble (bagging of decision trees)
Temeljni izvor	Cover, T. & Hart, P. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13(1), 21–27.	Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth.	Ribeiro, M. T., Singh, S., & Guestrin, C. (2016). "Why should I trust you?": Explaining the predictions of any classifier. ACM SIGKDD, 1135–1144.	Mitchell, T. M. (1997). Machine Learning. McGraw-Hill. ISBN: 978-0070428072	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
Drugi nazivi	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	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Srodne	4	5	2	4	4
Sažetak	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.	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.