方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 高斯混合模型× | 主成分分析× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1977 | 2002 |
| 提出者≠ | Dempster, Laird & Rubin (EM algorithm) | Jolliffe, I.T. (textbook); Pearson & Hotelling (origins) |
| 类型≠ | Probabilistic (soft) clustering — mixture model | Unsupervised dimensionality reduction |
| 开创性文献≠ | 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 ↗ | Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer. DOI ↗ |
| 别名≠ | Gaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of Gaussians | Temel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform |
| 相关≠ | 4 | 3 |
| 摘要≠ | 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. | Principal Component Analysis (PCA) is an unsupervised dimensionality-reduction method — given its modern textbook treatment by Ian Jolliffe (2002) — that compresses high-dimensional data into fewer dimensions while preserving the maximum possible variance. It re-expresses correlated variables as a small set of uncorrelated principal components ordered by how much of the data's variation each one captures. |
| ScholarGate数据集 ↗ |
|
|