方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 主成分分析× | 层次聚类× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2002 | 1963 |
| 提出者≠ | Jolliffe, I.T. (textbook); Pearson & Hotelling (origins) | Ward, J. H. |
| 类型≠ | Unsupervised dimensionality reduction | Unsupervised clustering (agglomerative) |
| 开创性文献≠ | Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer. DOI ↗ | Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗ |
| 别名≠ | Temel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform | Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering |
| 相关≠ | 3 | 4 |
| 摘要≠ | 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. | 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数据集 ↗ |
|
|