방법 비교

	계층적 군집화	DBSCAN
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	1963	1996
창시자	Ward, J. H.	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.
유형	Unsupervised clustering (agglomerative)	Density-based clustering algorithm
원전	Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244.	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.
별칭	Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering	DBSCAN Kümeleme, density-based clustering, density-based spatial clustering
관련	4	3
요약	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.	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.