방법 비교

	K-means 군집화	준지도학습 DBSCAN
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	1967 (formalized 1982)	2000s
창시자	MacQueen, J. B.; Lloyd, S. P.	Ester, M. et al. (DBSCAN base); semi-supervised extensions by multiple authors (2000s–2010s)
유형	Partitional clustering	Constrained density-based clustering
원전	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.
별칭	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
관련	4	5
요약	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.