ScholarGate
助手

方法对比

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

可解释 DBSCAN×DBSCAN×
领域机器学习机器学习
方法族Machine learningMachine learning
起源年份1996 (DBSCAN); 2010s (XAI integration)1996
提出者Ester, M. et al. (DBSCAN); XAI layer via Lundberg & Lee (SHAP)Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.
类型Unsupervised clustering with post-hoc interpretabilityDensity-based clustering algorithm
开创性文献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 ↗Ester, 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 ↗
别名XAI-DBSCAN, interpretable DBSCAN, transparent density clustering, DBSCAN with post-hoc explanationDBSCAN Kümeleme, density-based clustering, density-based spatial clustering
相关53
摘要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.DBSCAN 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.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Explainable DBSCAN · DBSCAN. 于 2026-06-15 检索自 https://scholargate.app/zh/compare