Patch alignment for graph embedding
- Publication Type:
- Chapter
- Citation:
- Graph Embedding for Pattern Analysis, 2013, pp. 73 - 118
- Issue Date:
- 2013-01-01
Closed Access
Filename | Description | Size | |||
---|---|---|---|---|---|
2013003854OK.pdf | 2.1 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© Springer Science+Business Media New York 2013. Dozens of manifold learning-based dimensionality reduction algorithms have been proposed in the literature. The most representative ones are locally linear embedding (LLE) [65], ISOMAP [76], Laplacian eigenmaps (LE) [4], Hessian eigenmaps (HLLE) [20], and local tangent space alignment (LTSA) [102]. LLE uses linear coefficients, which reconstruct a given example by its neighbors, to represent the local geometry, and then seeks a low-dimensional embedding, in which these coefficients are still suitable for reconstruction. ISOMAP preserves global geodesic distances of all the pairs of examples.
Please use this identifier to cite or link to this item: