Using locally estimated geodesic distance to optimize neighborhood graph for isometric data embedding
Authors:
- 1 July 2008
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 41 (7) , 2226-2236
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Globalizing Local Neighborhood for Locally Linear Embedding2006
- Clustering-based Locally Linear Embedding2006
- Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary DimensionsIEEE Transactions on Automatic Control, 2006
- Building k-connected neighborhood graphs for isometric data embeddingIEEE Transactions on Pattern Analysis and Machine Intelligence, 2006
- Incremental nonlinear dimensionality reduction by manifold learningIEEE Transactions on Pattern Analysis and Machine Intelligence, 2006
- Supervised Nonlinear Dimensionality Reduction for Visualization and ClassificationIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2005
- Building k edge-disjoint spanning trees of minimum total length for isometric data embeddingIEEE Transactions on Pattern Analysis and Machine Intelligence, 2005
- K-edge connected neighborhood graph for geodesic distance estimation and nonlinear data projection2004
- Nonlinear Dimensionality Reduction by Locally Linear EmbeddingScience, 2000
- A Global Geometric Framework for Nonlinear Dimensionality ReductionScience, 2000