So sánh phương pháp

	HDBSCAN	Phân cụm K-means
Lĩnh vực	Học máy	Học máy
Họ	Machine learning	Machine learning
Năm ra đời	2013	1967 (formalized 1982)
Người khởi xướng	Campello, R. J. G. B.; Moulavi, D.; Sander, J.	MacQueen, J. B.; Lloyd, S. P.
Loại	Hierarchical density-based clustering	Partitional clustering
Công trình gốc	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.
Tên gọi khác	HDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*	k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means
Liên quan	3	4
Tóm tắt	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.