ScholarGate
Asistenti

Krahasoni metodat

Shqyrtoni metodat e zgjedhura krah për krah; rreshtat që ndryshojnë janë të theksuar.

K-Përafërtet më të afërt të shpjegueshëm×LIME: Shpjegime Lokale të Interpretuara, të Pavarura nga Modeli×Naive Bayes×Pylli i Rastësishëm×
FushaMësimi i makinësMësimi i makinësMësimi i makinësMësimi i makinës
FamiljaMachine learningMachine learningMachine learningMachine learning
Viti i origjinës1967 (KNN); 2010s (explainability extensions)201619972001
KrijuesiCover, T. & Hart, P. (KNN); XAI extensions by various authorsMarco Ribeiro, Sameer Singh & Carlos GuestrinMitchell, T. M. (textbook treatment)Breiman, L.
LlojiInstance-based learning with explainability layerpost-hoc local explanationProbabilistic classifier (Bayes' theorem with conditional independence)Ensemble (bagging of decision trees)
Burimi themeluesCover, T. & Hart, P. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13(1), 21–27. 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-0070428072Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
Emërtime të tjeraXKNN, Interpretable KNN, Explainable KNN, Transparent K-Nearest NeighborsLocal Surrogate Explanations, Model-Agnostic Local Explanations, Locally Faithful Approximations, Yerel Yorumlanabilir Model-Bağımsız AçıklamalarNaive Bayes Sınıflandırıcı, naive bayes classifier, simple Bayes, Gaussian Naive BayesRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Të lidhura4244
PërmbledhjaExplainable 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.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.
ScholarGateSeti i të dhënave
  1. v1
  2. 2 Burimet
  3. PUBLISHED
  1. v1
  2. 1 Burimet
  3. PUBLISHED
  1. v1
  2. 1 Burimet
  3. PUBLISHED
  1. v1
  2. 2 Burimet
  3. PUBLISHED

Shko te kërkimi Shkarko diapozitivat

ScholarGateKrahasoni metodat: Explainable K-Nearest Neighbors · LIME · Naive Bayes · Random Forest. Marrë më 2026-06-20 nga https://scholargate.app/sq/compare