השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| Ensemble HDBSCAN× | K-means מאוחד (Ensemble K-means)× | HDBSCAN× | HDBSCAN בהנחיה חלקית× | |
|---|---|---|---|---|
| תחום | למידת מכונה | למידת מכונה | למידת מכונה | למידת מכונה |
| משפחה | Machine learning | Machine learning | Machine learning | Machine learning |
| שנת המקור≠ | 2011–2017 | 2002 | 2013 | 2017–present |
| הוגה השיטה≠ | Vega-Pons, S. & Ruiz-Shulcloper, J. (ensemble clustering framework); McInnes, L. et al. (HDBSCAN base) | Strehl, A. & Ghosh, J. | Campello, R. J. G. B.; Moulavi, D.; Sander, J. | McInnes, L.; Healy, J. (base HDBSCAN); semi-supervised extensions by various authors |
| סוג≠ | Consensus clustering ensemble | Ensemble clustering (consensus aggregation of K-means partitions) | Hierarchical density-based clustering | Semi-supervised density-based clustering |
| מקור מכונן≠ | 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 ↗ | 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 ↗ | McInnes, L., Healy, J., & Astels, S. (2017). hdbscan: Hierarchical density based clustering. Journal of Open Source Software, 2(11), 205. DOI ↗ |
| כינויים | HDBSCAN ensemble clustering, consensus HDBSCAN, multi-run HDBSCAN, cluster ensemble HDBSCAN | consensus K-means, K-means ensemble clustering, cluster ensemble with K-means, EKM | HDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN* | Constrained HDBSCAN, Semi-supervised hierarchical density clustering, HDBSCAN with partial labels, SS-HDBSCAN |
| קשורות≠ | 4 | 3 | 3 | 6 |
| תקציר≠ | 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. | 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. | Semi-supervised HDBSCAN extends the Hierarchical Density-Based Spatial Clustering of Applications with Noise (HDBSCAN) algorithm by incorporating partial supervision — such as must-link and cannot-link pairwise constraints or a small set of labeled examples — to guide the density-based cluster hierarchy toward cluster assignments that are consistent with available domain knowledge. |
| ScholarGateמערך נתונים ↗ |
|
|
|
|