方法对比

	可解释 K-近邻算法	LIME：局部可解释模型无关解释	随机森林
领域	机器学习	机器学习	机器学习
方法族	Machine learning	Machine learning	Machine learning
起源年份	1967 (KNN); 2010s (explainability extensions)	2016	2001
提出者	Cover, T. & Hart, P. (KNN); XAI extensions by various authors	Marco Ribeiro, Sameer Singh & Carlos Guestrin	Breiman, L.
类型	Instance-based learning with explainability layer	post-hoc local explanation	Ensemble (bagging of decision trees)
开创性文献	Cover, T. & Hart, P. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13(1), 21–27.	Ribeiro, M. T., Singh, S., & Guestrin, C. (2016). "Why should I trust you?": Explaining the predictions of any classifier. ACM SIGKDD, 1135–1144.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
别名	XKNN, Interpretable KNN, Explainable KNN, Transparent K-Nearest Neighbors	Local Surrogate Explanations, Model-Agnostic Local Explanations, Locally Faithful Approximations, Yerel Yorumlanabilir Model-Bağımsız Açıklamalar	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
相关	4	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.	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.	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.