So sánh phương pháp

	HDBSCAN	OPTICS	Phân cụm phổ
Lĩnh vực	Học máy	Học máy	Học máy
Họ	Machine learning	Machine learning	Machine learning
Năm ra đời	2013	1999	2002
Người khởi xướng	Campello, R. J. G. B.; Moulavi, D.; Sander, J.	Ankerst, M.; Breunig, M. M.; Kriegel, H.-P.; Sander, J.	Ng, A. Y.; Jordan, M. I.; Weiss, Y.
Loại	Hierarchical density-based clustering	Density-based clustering (reachability ordering)	Graph-based clustering (spectral method)
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.	Ankerst, M., Breunig, M. M., Kriegel, H.-P., & Sander, J. (1999). OPTICS: Ordering points to identify the clustering structure. ACM SIGMOD Record, 28(2), 49–60.	Ng, A. Y., Jordan, M. I., & Weiss, Y. (2002). On Spectral Clustering: Analysis and an Algorithm. Advances in Neural Information Processing Systems, 14, 849–856.
Tên gọi khác	HDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*	OPTICS, Ordering Points To Identify the Clustering Structure, density-based clustering with reachability plot, generalized DBSCAN	NJW spectral clustering, graph Laplacian clustering, normalized spectral clustering, spectral graph clustering
Liên quan	3	3	5
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.	OPTICS (Ordering Points To Identify the Clustering Structure) is a density-based clustering algorithm introduced by Ankerst, Breunig, Kriegel, and Sander in 1999. It generalizes DBSCAN by processing points in an ordering that encodes the full density-based cluster structure of a dataset, enabling the detection of clusters of varying densities through a reachability plot rather than requiring a fixed global density threshold.	Spectral Clustering is a graph-based unsupervised learning algorithm, formalized by Ng, Jordan, and Weiss in 2002, that maps data points into a low-dimensional eigenspace derived from the similarity graph's Laplacian before applying k-means. This spectral embedding makes it possible to recover clusters of arbitrary shape — rings, crescents, interleaved spirals — that Euclidean distance-based methods consistently fail to separate.