방법 비교

	DBSCAN	계층적 군집화
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	1996	1963
창시자	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.	Ward, J. H.
유형	Density-based clustering algorithm	Unsupervised clustering (agglomerative)
원전	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.	Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244.
별칭	DBSCAN Kümeleme, density-based clustering, density-based spatial clustering	Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering
관련	3	4
요약	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.	Hierarchical clustering is an unsupervised method that groups observations into nested clusters and draws the result as a dendrogram, so the number of clusters need not be fixed in advance. Its agglomerative form rests on the objective-function grouping criterion introduced by Joe Ward in 1963.