方法对比

	可解释 K-近邻算法	决策树	随机森林
领域	机器学习	机器学习	机器学习
方法族	Machine learning	Machine learning	Machine learning
起源年份	1967 (KNN); 2010s (explainability extensions)	1984	2001
提出者	Cover, T. & Hart, P. (KNN); XAI extensions by various authors	Breiman, Friedman, Olshen & Stone	Breiman, L.
类型	Instance-based learning with explainability layer	Recursive partitioning (if-then rules)	Ensemble (bagging of decision trees)
开创性文献	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.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
别名	XKNN, Interpretable KNN, Explainable KNN, Transparent K-Nearest Neighbors	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
相关	4	5	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.	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.