مقایسهٔ روشها
روشهای انتخابی خود را کنار هم مرور کنید؛ ردیفهای متفاوت برجسته شدهاند.
| Ensemble HDBSCAN× | خوشهبندی K-means× | |
|---|---|---|
| حوزه | یادگیری ماشین | یادگیری ماشین |
| خانواده | Machine learning | Machine learning |
| سال پیدایش≠ | 2011–2017 | 1967 (formalized 1982) |
| پدیدآور≠ | Vega-Pons, S. & Ruiz-Shulcloper, J. (ensemble clustering framework); McInnes, L. et al. (HDBSCAN base) | MacQueen, J. B.; Lloyd, S. P. |
| نوع≠ | Consensus clustering ensemble | Partitional clustering |
| منبع بنیادین≠ | McInnes, L., Healy, J., & Astels, S. (2017). hdbscan: Hierarchical density based clustering. Journal of Open Source Software, 2(11), 205. DOI ↗ | Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗ |
| نامهای دیگر | HDBSCAN ensemble clustering, consensus HDBSCAN, multi-run HDBSCAN, cluster ensemble HDBSCAN | k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means |
| مرتبط | 4 | 4 |
| خلاصه≠ | 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. | K-means is a classic unsupervised partitional clustering algorithm that divides a dataset into K non-overlapping groups by iteratively assigning each observation to its nearest centroid and updating centroids as the mean of their assigned points. It is one of the most widely used exploratory tools in machine learning and data analysis. |
| ScholarGateمجموعهداده ↗ |
|
|