ScholarGate
アシスタント

手法を比較

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

オンラインHDBSCAN×Ensemble HDBSCAN×HDBSCAN×
分野機械学習機械学習機械学習
系統Machine learningMachine learningMachine learning
提唱年2015–20172011–20172013
提唱者Campello, R. J. G. B. et al. (base); incremental extensions by Hassani, M. et al.Vega-Pons, S. & Ruiz-Shulcloper, J. (ensemble clustering framework); McInnes, L. et al. (HDBSCAN base)Campello, R. J. G. B.; Moulavi, D.; Sander, J.
種類Incremental hierarchical density-based clusteringConsensus clustering ensembleHierarchical density-based clustering
原典Hassani, M., Seidl, T. (2017). Using internal evaluation measures to validate the quality of diverse stream clustering algorithms. Vietnam Journal of Computer Science, 4(3), 171–183. DOI ↗McInnes, L., Healy, J., & Astels, S. (2017). hdbscan: Hierarchical density based clustering. Journal of Open Source Software, 2(11), 205. 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 ↗
別名incremental HDBSCAN, streaming HDBSCAN, online hierarchical density clustering, dynamic HDBSCANHDBSCAN ensemble clustering, consensus HDBSCAN, multi-run HDBSCAN, cluster ensemble HDBSCANHDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*
関連643
概要Online HDBSCAN extends the HDBSCAN hierarchical density-based clustering algorithm to incrementally process streaming or sequentially arriving data. Rather than rebuilding the full hierarchy from scratch with each new observation, it maintains and locally updates the mutual reachability graph, minimum spanning tree, condensed cluster tree, and stability-based cluster extraction, enabling continuous density-based clustering without full-dataset reprocessing.Ensemble HDBSCAN runs HDBSCAN multiple times under different hyperparameter settings or data subsamples and combines the resulting partitions into a single stable consensus clustering. Because HDBSCAN is sensitive to its minimum cluster size and minimum samples parameters, pooling multiple runs greatly reduces sensitivity to any single configuration and yields more reproducible cluster assignments on noisy, high-dimensional data.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. 2 出典
  3. PUBLISHED
  1. v1
  2. 3 出典
  3. PUBLISHED

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

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