手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| Ensemble HDBSCAN× | アンサンブルK-means× | |
|---|---|---|
| 分野 | 機械学習 | 機械学習 |
| 系統 | Machine learning | Machine learning |
| 提唱年≠ | 2011–2017 | 2002 |
| 提唱者≠ | Vega-Pons, S. & Ruiz-Shulcloper, J. (ensemble clustering framework); McInnes, L. et al. (HDBSCAN base) | Strehl, A. & Ghosh, J. |
| 種類≠ | Consensus clustering ensemble | Ensemble clustering (consensus aggregation of K-means partitions) |
| 原典≠ | McInnes, L., Healy, J., & Astels, S. (2017). hdbscan: Hierarchical density based clustering. Journal of Open Source Software, 2(11), 205. DOI ↗ | Strehl, A. & Ghosh, J. (2002). Cluster ensembles — a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research, 3, 583–617. link ↗ |
| 別名 | HDBSCAN ensemble clustering, consensus HDBSCAN, multi-run HDBSCAN, cluster ensemble HDBSCAN | consensus K-means, K-means ensemble clustering, cluster ensemble with K-means, EKM |
| 関連≠ | 4 | 3 |
| 概要≠ | 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. | Ensemble K-means runs K-means clustering many times under varied initializations, random seeds, or feature subsets, then aggregates the resulting partitions into a single consensus assignment. This approach reduces K-means' well-known sensitivity to initialization and produces more stable, reproducible clusters than any single run. |
| ScholarGateデータセット ↗ |
|
|