方法对比
并排查看您选择的方法;存在差异的行会高亮显示。
| 局部线性嵌入 (LLE)× | Mapper算法× | |
|---|---|---|
| 领域≠ | 机器学习 | 拓扑学 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2000 | 2007 |
| 提出者≠ | Sam Roweis & Lawrence Saul | Singh, Mémoli & Carlsson |
| 类型≠ | Nonlinear manifold dimensionality reduction | Graph-based topological summarization |
| 开创性文献≠ | Roweis, S. T., & Saul, L. K. (2000). Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500), 2323–2326. DOI ↗ | Singh, G., Mémoli, F., & Carlsson, G. (2007). Topological methods for the analysis of high dimensional data sets and 3D object recognition. Eurographics Symposium on Point-Based Graphics, 91–100. DOI ↗ |
| 别名 | LLE, manifold learning, nonlinear dimensionality reduction, yerel doğrusal gömme | Topological Mapper, TDA Mapper, Reeb Graph Approximation, Eşleyici Algoritma |
| 相关≠ | 3 | 2 |
| 摘要≠ | Locally linear embedding, introduced by Sam Roweis and Lawrence Saul in 2000, is a manifold-learning method for nonlinear dimensionality reduction. It assumes that although data may curve through a high-dimensional space, each point and its neighbours lie approximately on a flat patch. LLE captures each point as a weighted combination of its neighbours and then finds a low-dimensional layout that preserves those same local relationships, unrolling curved structure into a faithful low-dimensional map. | The Mapper algorithm is a method in topological data analysis (TDA) that produces a graph-based summary of the shape of high-dimensional point cloud data. Introduced by Singh, Mémoli, and Carlsson in 2007 at the Eurographics Symposium on Point-Based Graphics, Mapper constructs a simplicial complex — typically a graph — that captures the global topological and geometric structure of a dataset without requiring a fixed embedding or metric assumption. |
| ScholarGate数据集 ↗ |
|
|