ScholarGate
Asistente

Comparar métodos

Revisa los métodos seleccionados uno junto a otro; las filas que difieren aparecen resaltadas.

DBSCAN×Isolation Forest Explicable×Vecinos más Cercanos Explicables (Explainable K-Nearest Neighbors)×
CampoAprendizaje automáticoAprendizaje automáticoAprendizaje automático
FamiliaMachine learningMachine learningMachine learning
Año de origen19962008 / 20171967 (KNN); 2010s (explainability extensions)
Autor originalEster, M., Kriegel, H.-P., Sander, J. & Xu, X.Liu, F. T., Ting, K. M., & Zhou, Z.-H. (Isolation Forest); Lundberg, S. M. & Lee, S.-I. (SHAP explainability layer)Cover, T. & Hart, P. (KNN); XAI extensions by various authors
TipoDensity-based clustering algorithmAnomaly detection with post-hoc explainabilityInstance-based learning with explainability layer
Fuente seminalEster, M., Kriegel, H.-P., Sander, J. & Xu, X. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd KDD, 226–231. link ↗Lundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 4765–4774. link ↗Cover, T. & Hart, P. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13(1), 21–27. DOI ↗
AliasDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringXIF, Isolation Forest with SHAP, interpretable anomaly detection, explainable anomaly isolationXKNN, Interpretable KNN, Explainable KNN, Transparent K-Nearest Neighbors
Relacionados354
ResumenDBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes.Explainable Isolation Forest combines the Isolation Forest anomaly detection algorithm with post-hoc explainability tools — most commonly SHAP (SHapley Additive exPlanations) — to not only flag anomalous observations but also reveal which features drove each anomaly score. It bridges unsupervised anomaly detection with the interpretability demands of regulated and high-stakes domains.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.
ScholarGateConjunto de datos
  1. v1
  2. 1 Fuentes
  3. PUBLISHED
  1. v1
  2. 2 Fuentes
  3. PUBLISHED
  1. v1
  2. 2 Fuentes
  3. PUBLISHED

Ir a la búsqueda Descargar diapositivas

ScholarGateComparar métodos: DBSCAN · Explainable Isolation Forest · Explainable K-Nearest Neighbors. Recuperado el 2026-06-18 de https://scholargate.app/es/compare