ScholarGate
アシスタント

手法を比較

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

Explainable K-Nearest Neighbors×HDBSCAN×
分野機械学習機械学習
系統Machine learningMachine learning
提唱年1967 (KNN); 2010s (explainability extensions)2013
提唱者Cover, T. & Hart, P. (KNN); XAI extensions by various authorsCampello, R. J. G. B.; Moulavi, D.; Sander, J.
種類Instance-based learning with explainability layerHierarchical density-based clustering
原典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 ↗
別名XKNN, Interpretable KNN, Explainable KNN, Transparent K-Nearest NeighborsHDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*
関連43
概要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. 3 出典
  3. PUBLISHED

検索へ スライドをダウンロード

ScholarGate手法を比較: Explainable K-Nearest Neighbors · HDBSCAN. 2026-06-18に以下より取得 https://scholargate.app/ja/compare