Uporedite metode

	Робусни HDBSCAN	HDBSCAN	K-means algoritam klasterovanja
Oblast	Mašinsko učenje	Mašinsko učenje	Mašinsko učenje
Porodica	Machine learning	Machine learning	Machine learning
Godina nastanka	2015	2013	1967 (formalized 1982)
Tvorac	Campello, R.J.G.B.; Moulavi, D.; Zimek, A.; Sander, J.	Campello, R. J. G. B.; Moulavi, D.; Sander, J.	MacQueen, J. B.; Lloyd, S. P.
Tip	Hierarchical density-based clustering with robust single-linkage	Hierarchical density-based clustering	Partitional clustering
Temeljni izvor	Campello, R.J.G.B., Moulavi, D., Zimek, A. & Sander, J. (2015). Hierarchical Density Estimates for Data Clustering, Visualization, and Outlier Detection. ACM Transactions on Knowledge Discovery from Data, 10(1), 5.	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.
Drugi nazivi	HDBSCAN*, Robust HDBSCAN*, robust hierarchical density clustering, robust single-linkage HDBSCAN	HDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*	k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means
Srodne	4	3	4
Sažetak	Robust HDBSCAN (HDBSCAN*) extends the original HDBSCAN algorithm with a robust single-linkage framework that handles noise, outliers, and clusters of varying densities more reliably. Introduced by Campello et al. (2015), it converts any density-based hierarchy into a stable flat clustering while explicitly modeling noise points — without requiring the user to pre-specify the number of clusters.	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.