Сравнение методов

	HDBSCAN	Полуавтоматический DBSCAN
Область	Машинное обучение	Машинное обучение
Семейство	Machine learning	Machine learning
Год появления	2013	2000s
Автор метода	Campello, R. J. G. B.; Moulavi, D.; Sander, J.	Ester, M. et al. (DBSCAN base); semi-supervised extensions by multiple authors (2000s–2010s)
Тип	Hierarchical density-based clustering	Constrained density-based clustering
Основополагающий источник	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.	Ester, M., Kriegel, H.-P., Sander, J., & Xu, X. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96), pp. 226–231. AAAI Press.
Другие названия	HDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*	Constrained DBSCAN, SS-DBSCAN, DBSCAN with must-link/cannot-link constraints, seeded DBSCAN
Связанные	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.	Semi-supervised DBSCAN extends the canonical density-based clustering algorithm (Ester et al., 1996) by incorporating a small set of pairwise or label constraints — must-link pairs that must share a cluster, cannot-link pairs that must be separated, or a handful of known labels — to guide cluster formation while retaining DBSCAN's ability to discover arbitrary-shaped clusters and flag noise points.