ScholarGate
Assistente

Comparar métodos

Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.

K-Vizinhos Mais Próximos Explicável×Árvore de Decisão×Random Forest×
ÁreaAprendizado de máquinaAprendizado de máquinaAprendizado de máquina
FamíliaMachine learningMachine learningMachine learning
Ano de origem1967 (KNN); 2010s (explainability extensions)19842001
Autor originalCover, T. & Hart, P. (KNN); XAI extensions by various authorsBreiman, Friedman, Olshen & StoneBreiman, L.
TipoInstance-based learning with explainability layerRecursive partitioning (if-then rules)Ensemble (bagging of decision trees)
Fonte seminalCover, 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 ↗
Outros nomesXKNN, 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
Relacionados454
ResumoExplainable 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.
ScholarGateConjunto de dados
  1. v1
  2. 2 Fontes
  3. PUBLISHED
  1. v1
  2. 1 Fontes
  3. PUBLISHED
  1. v1
  2. 2 Fontes
  3. PUBLISHED

Ir para a pesquisa Baixar slides

ScholarGateComparar métodos: Explainable K-Nearest Neighbors · Decision Tree · Random Forest. Recuperado em 2026-06-19 de https://scholargate.app/pt/compare