方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| DBSCAN× | 高斯混合模型× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1996 | 1977 |
| 提出者≠ | Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. | Dempster, Laird & Rubin (EM algorithm) |
| 类型≠ | Density-based clustering algorithm | Probabilistic (soft) clustering — mixture model |
| 开创性文献≠ | 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. link ↗ | 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. DOI ↗ |
| 别名≠ | DBSCAN Kümeleme, density-based clustering, density-based spatial clustering | Gaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of Gaussians |
| 相关≠ | 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. | 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. |
| ScholarGate数据集 ↗ |
|
|