ScholarGate
Asistent

Compară metode

Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.

K-Nearest Neighbors explicabil×Arbore de decizie×Pădurea Aleatoare (Random Forest)×
DomeniuÎnvățare automatăÎnvățare automatăÎnvățare automată
FamilieMachine learningMachine learningMachine learning
Anul apariției1967 (KNN); 2010s (explainability extensions)19842001
Autorul originalCover, T. & Hart, P. (KNN); XAI extensions by various authorsBreiman, Friedman, Olshen & StoneBreiman, L.
TipInstance-based learning with explainability layerRecursive partitioning (if-then rules)Ensemble (bagging of decision trees)
Sursa seminalăCover, T. & Hart, P. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13(1), 21–27. DOI ↗Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
Denumiri alternativeXKNN, Interpretable KNN, Explainable KNN, Transparent K-Nearest NeighborsKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Înrudite454
RezumatExplainable 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.
ScholarGateSet de date
  1. v1
  2. 2 Surse
  3. PUBLISHED
  1. v1
  2. 1 Surse
  3. PUBLISHED
  1. v1
  2. 2 Surse
  3. PUBLISHED

Mergi la căutare Descarcă prezentarea

ScholarGateCompară metode: Explainable K-Nearest Neighbors · Decision Tree · Random Forest. Preluat la 2026-06-20 de pe https://scholargate.app/ro/compare