방법 비교

	HDBSCAN	온라인 가우시안 혼합 모델
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	2013	2000–2009
창시자	Campello, R. J. G. B.; Moulavi, D.; Sander, J.	Cappé, O. & Moulines, E. (online EM formulation)
유형	Hierarchical density-based clustering	Probabilistic clustering / density estimation (incremental)
원전	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.	Cappé, O. & Moulines, E. (2009). On-line expectation-maximization algorithm for latent data models. Journal of the Royal Statistical Society: Series B, 71(3), 593–613.
별칭	HDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*	Online GMM, Incremental GMM, Streaming Gaussian Mixture Model, Sequential GMM
관련	3	5
요약	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.	Online Gaussian Mixture Model adapts the classic GMM to streaming or large-scale data by replacing full-batch EM with incremental updates — processing one observation or mini-batch at a time and continuously refining component means, covariances, and mixing weights without revisiting the entire dataset.