Methoden vergleichen

	DBSCAN	K-means Clustering	Halbüberwachtes DBSCAN
Fachgebiet	Maschinelles Lernen	Maschinelles Lernen	Maschinelles Lernen
Familie	Machine learning	Machine learning	Machine learning
Entstehungsjahr	1996	1967 (formalized 1982)	2000s
Urheber	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.	MacQueen, J. B.; Lloyd, S. P.	Ester, M. et al. (DBSCAN base); semi-supervised extensions by multiple authors (2000s–2010s)
Typ	Density-based clustering algorithm	Partitional clustering	Constrained density-based clustering
Wegweisende Quelle	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd KDD, 226–231.	Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137.	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.
Aliasnamen	DBSCAN Kümeleme, density-based clustering, density-based spatial clustering	k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means	Constrained DBSCAN, SS-DBSCAN, DBSCAN with must-link/cannot-link constraints, seeded DBSCAN
Verwandt	3	4	5
Zusammenfassung	DBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes.	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.	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.