ScholarGate
アシスタント

手法を比較

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

DBSCAN×HDBSCAN×
分野機械学習機械学習
系統Machine learningMachine learning
提唱年19962013
提唱者Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.Campello, R. J. G. B.; Moulavi, D.; Sander, J.
種類Density-based clustering algorithmHierarchical 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. Proceedings of the 2nd KDD, 226–231. link ↗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 ↗
別名DBSCAN Kümeleme, density-based clustering, density-based spatial clusteringHDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*
関連33
概要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.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. 1 出典
  3. PUBLISHED
  1. v1
  2. 3 出典
  3. PUBLISHED

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

ScholarGate手法を比較: DBSCAN · HDBSCAN. 2026-06-17に以下より取得 https://scholargate.app/ja/compare