قارن الطرق

	HDBSCAN	التجميع الطيفي (Spectral Clustering)
المجال	تعلم الآلة	تعلم الآلة
العائلة	Machine learning	Machine learning
سنة النشأة	2013	2002
صاحب الطريقة	Campello, R. J. G. B.; Moulavi, D.; Sander, J.	Ng, A. Y.; Jordan, M. I.; Weiss, Y.
النوع	Hierarchical density-based clustering	Graph-based clustering (spectral method)
المصدر التأسيسي	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.	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.
الأسماء البديلة	HDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*	NJW spectral clustering, graph Laplacian clustering, normalized spectral clustering, spectral graph clustering
ذات صلة	3	5
الملخص	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.	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.