方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| Isomap× | 主成分分析× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族≠ | Latent structure | Machine learning |
| 起源年份≠ | 2000 | 2002 |
| 提出者≠ | Tenenbaum, J. B.; de Silva, V.; Langford, J. C. | Jolliffe, I.T. (textbook); Pearson & Hotelling (origins) |
| 类型≠ | Manifold learning / nonlinear dimensionality reduction | Unsupervised dimensionality reduction |
| 开创性文献≠ | Tenenbaum, J. B., de Silva, V. & Langford, J. C. (2000). A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500), 2319–2323. DOI ↗ | Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer. DOI ↗ |
| 别名 | Isomap, isometric feature mapping, geodesic Isomap, nonlinear MDS | Temel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform |
| 相关 | 3 | 3 |
| 摘要≠ | Isomap (Isometric Feature Mapping) is a manifold learning algorithm introduced by Tenenbaum, de Silva, and Langford in 2000 that discovers the intrinsic low-dimensional geometry of high-dimensional data by preserving geodesic — rather than straight-line Euclidean — distances between all pairs of points. It was one of the earliest, and most influential, nonlinear dimensionality reduction methods to demonstrate that genuinely curved data manifolds could be unfolded into a faithful low-dimensional coordinate system. | 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数据集 ↗ |
|
|