ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

Explainable 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/ja/compare