Comparar métodos

	HDBSCAN semisupervisado	HDBSCAN	Agrupamiento K-medias
Campo	Aprendizaje automático	Aprendizaje automático	Aprendizaje automático
Familia	Machine learning	Machine learning	Machine learning
Año de origen	2017–present	2013	1967 (formalized 1982)
Autor original	McInnes, L.; Healy, J. (base HDBSCAN); semi-supervised extensions by various authors	Campello, R. J. G. B.; Moulavi, D.; Sander, J.	MacQueen, J. B.; Lloyd, S. P.
Tipo	Semi-supervised density-based clustering	Hierarchical density-based clustering	Partitional clustering
Fuente seminal	McInnes, L., Healy, J., & Astels, S. (2017). hdbscan: Hierarchical density based clustering. Journal of Open Source Software, 2(11), 205.	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.	Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137.
Alias	Constrained HDBSCAN, Semi-supervised hierarchical density clustering, HDBSCAN with partial labels, SS-HDBSCAN	HDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*	k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means
Relacionados	6	3	4
Resumen	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.	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.	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.