Porównaj metody

	DBSCAN	Model Gaussa (Gaussian Mixture Model)
Dziedzina	Uczenie maszynowe	Uczenie maszynowe
Rodzina	Machine learning	Machine learning
Rok powstania	1996	1977
Twórca	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.	Dempster, Laird & Rubin (EM algorithm)
Typ	Density-based clustering algorithm	Probabilistic (soft) clustering — mixture model
Źródło pierwotne	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.	Dempster, A.P., Laird, N.M. & Rubin, D.B. (1977). Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society: Series B, 39(1), 1–22.
Inne nazwy	DBSCAN Kümeleme, density-based clustering, density-based spatial clustering	Gaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of Gaussians
Pokrewne	3	4
Podsumowanie	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.	A Gaussian Mixture Model is a probabilistic clustering method that models the data as a weighted mixture of several Gaussian distributions, fitted with the Expectation–Maximization algorithm formalized by Dempster, Laird & Rubin in 1977. It is a generalization of K-means in which each cluster can take its own shape, size, and orientation.