ScholarGate
助手

方法对比

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

DBSCAN×可解释隔离森林×
领域机器学习机器学习
方法族Machine learningMachine learning
起源年份19962008 / 2017
提出者Ester, 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)
类型Density-based clustering algorithmAnomaly detection with post-hoc explainability
开创性文献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 ↗Lundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 4765–4774. link ↗
别名DBSCAN Kümeleme, density-based clustering, density-based spatial clusteringXIF, Isolation Forest with SHAP, interpretable anomaly detection, explainable anomaly isolation
相关35
摘要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.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.
ScholarGate数据集
  1. v1
  2. 1 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

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