ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

可解释 K-近邻算法×LIME:局部可解释模型无关解释×朴素贝叶斯 (Naive Bayes) 是一种快速的概率分类器,它应用贝叶斯定理,同时假设特征在给定类别时是条件独立的×随机森林×
领域机器学习机器学习机器学习机器学习
方法族Machine learningMachine learningMachine learningMachine learning
起源年份1967 (KNN); 2010s (explainability extensions)201619972001
提出者Cover, T. & Hart, P. (KNN); XAI extensions by various authorsMarco Ribeiro, Sameer Singh & Carlos GuestrinMitchell, T. M. (textbook treatment)Breiman, L.
类型Instance-based learning with explainability layerpost-hoc local explanationProbabilistic classifier (Bayes' theorem with conditional independence)Ensemble (bagging of decision trees)
开创性文献Cover, 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 ↗
别名XKNN, 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
相关4244
摘要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.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.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Explainable K-Nearest Neighbors · LIME · Naive Bayes · Random Forest. 于 2026-06-20 检索自 https://scholargate.app/zh/compare