Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| HDBSCAN× | Ієрархічна кластеризація× | |
|---|---|---|
| Галузь | Машинне навчання | Машинне навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 2013 | 1963 |
| Автор методу≠ | Campello, R. J. G. B.; Moulavi, D.; Sander, J. | Ward, J. H. |
| Тип≠ | Hierarchical density-based clustering | Unsupervised clustering (agglomerative) |
| Основоположне джерело≠ | 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 ↗ | Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗ |
| Інші назви≠ | HDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN* | Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering |
| Пов'язані≠ | 3 | 4 |
| Підсумок≠ | 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. | Hierarchical clustering is an unsupervised method that groups observations into nested clusters and draws the result as a dendrogram, so the number of clusters need not be fixed in advance. Its agglomerative form rests on the objective-function grouping criterion introduced by Joe Ward in 1963. |
| ScholarGateНабір даних ↗ |
|
|