Patch Alignment for Graph Embedding

Publisher:
Springer New York
Publication Type:
Chapter
Citation:
Graph Embedding for Pattern Analysis, 2013, First edition, pp. 73 - 118
Issue Date:
2013-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013003854OK.pdf2.1 MB
Adobe PDF
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: