On a Connection between Maximum Variance Unfolding, Shortest Path Problems and IsoMap.
Alexander PaprotnyJochen GarckePublished in: AISTATS (2012)
Keyphrases
- maximum variance unfolding
- shortest path problem
- nonlinear dimensionality reduction
- shortest path
- metric learning
- laplacian eigenmaps
- combinatorial optimization problems
- manifold learning
- directed graph
- dimensionality reduction
- low dimensional
- multiple objectives
- high dimensional data
- pattern recognition
- directed acyclic graph
- knapsack problem
- high dimensional
- kernel pca
- feature space
- data analysis
- data sets