ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

可解释 DBSCAN×可解释 K-近邻算法×HDBSCAN×
领域机器学习机器学习机器学习
方法族Machine learningMachine learningMachine learning
起源年份1996 (DBSCAN); 2010s (XAI integration)1967 (KNN); 2010s (explainability extensions)2013
提出者Ester, M. et al. (DBSCAN); XAI layer via Lundberg & Lee (SHAP)Cover, T. & Hart, P. (KNN); XAI extensions by various authorsCampello, R. J. G. B.; Moulavi, D.; Sander, J.
类型Unsupervised clustering with post-hoc interpretabilityInstance-based learning with explainability layerHierarchical density-based clustering
开创性文献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 ↗Cover, T. & Hart, P. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13(1), 21–27. DOI ↗Campello, R. J. G. B., Moulavi, D., & Sander, J. (2013). Density-Based Clustering Based on Hierarchical Density Estimates. In J. Pei et al. (Eds.), Advances in Knowledge Discovery and Data Mining. PAKDD 2013. Lecture Notes in Computer Science, vol. 7819 (pp. 160–172). Springer, Berlin, Heidelberg. DOI ↗
别名XAI-DBSCAN, interpretable DBSCAN, transparent density clustering, DBSCAN with post-hoc explanationXKNN, Interpretable KNN, Explainable KNN, Transparent K-Nearest NeighborsHDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*
相关543
摘要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 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.HDBSCAN (Hierarchical Density-Based Spatial Clustering of Applications with Noise) is a density-based clustering algorithm introduced by Campello, Moulavi, and Sander in 2013. It extends DBSCAN by building a full hierarchy of density-based clusters across all density scales and then extracting a stable flat partition, making it robust to datasets where cluster densities vary substantially across regions.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 3 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Explainable DBSCAN · Explainable K-Nearest Neighbors · HDBSCAN. 于 2026-06-18 检索自 https://scholargate.app/zh/compare