方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 高斯混合模型× | 层次聚类× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1977 | 1963 |
| 提出者≠ | Dempster, Laird & Rubin (EM algorithm) | Ward, J. H. |
| 类型≠ | Probabilistic (soft) clustering — mixture model | Unsupervised clustering (agglomerative) |
| 开创性文献≠ | 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 ↗ | Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗ |
| 别名 | Gaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of Gaussians | Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering |
| 相关 | 4 | 4 |
| 摘要≠ | 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. | 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. |
| ScholarGate数据集 ↗ |
|
|