ScholarGate
Асистент

Сравнение на методи

Прегледайте избраните методи един до друг; редовете с разлики са откроени.

Обясним DBSCAN×Обясним изолационен лес×Обясним метод на K-най-близки съседи×
ОбластМашинно обучениеМашинно обучениеМашинно обучение
СемействоMachine learningMachine learningMachine learning
Година на възникване1996 (DBSCAN); 2010s (XAI integration)2008 / 20171967 (KNN); 2010s (explainability extensions)
СъздателEster, M. et al. (DBSCAN); XAI layer via Lundberg & Lee (SHAP)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
ТипUnsupervised clustering with post-hoc interpretabilityAnomaly detection with post-hoc explainabilityInstance-based learning with explainability layer
Основополагащ източникEster, M., Kriegel, H.-P., Sander, J., & Xu, X. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), 226–231. AAAI Press. 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 ↗
Други названияXAI-DBSCAN, interpretable DBSCAN, transparent density clustering, DBSCAN with post-hoc explanationXIF, Isolation Forest with SHAP, interpretable anomaly detection, explainable anomaly isolationXKNN, Interpretable KNN, Explainable KNN, Transparent K-Nearest Neighbors
Свързани554
РезюмеExplainable DBSCAN pairs the DBSCAN density-based clustering algorithm with post-hoc interpretability methods — most commonly SHAP values or local surrogate models — to reveal which input features drive the algorithm's cluster and noise assignments. It enables analysts to understand why specific points were grouped together or flagged as outliers, bridging the gap between powerful density-based partitioning and human-readable explanation.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.
ScholarGateНабор от данни
  1. v1
  2. 2 Източници
  3. PUBLISHED
  1. v1
  2. 2 Източници
  3. PUBLISHED
  1. v1
  2. 2 Източници
  3. PUBLISHED

Към търсенето Изтегляне на слайдове

ScholarGateСравнение на методи: Explainable DBSCAN · Explainable Isolation Forest · Explainable K-Nearest Neighbors. Извлечено на 2026-06-18 от https://scholargate.app/bg/compare