Building k Edge-Disjoint Spanning Trees of Minimum Total Length for Isometric Data Embedding

Authors:
Li Yang
Affiliations:
IEEE
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
2005

Citing 3
Cited 15

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
k-Edge Connected Neighborhood Graph for Geodesic Distance Estimation and Nonlinear Data Projection

ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
Curvilinear component analysis: a self-organizing neural network for nonlinear mapping of data sets

IEEE Transactions on Neural Networks

Building connected neighborhood graphs for isometric data embedding

Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Building k-Connected Neighborhood Graphs for Isometric Data Embedding

IEEE Transactions on Pattern Analysis and Machine Intelligence
Data embedding techniques and applications

Proceedings of the 2nd international workshop on Computer vision meets databases
Improving geodesic distance estimation based on locally linear assumption

Pattern Recognition Letters
Using locally estimated geodesic distance to optimize neighborhood graph for isometric data embedding

Pattern Recognition
Local relative transformation with application to isometric embedding

Pattern Recognition Letters
Relative transformation-based neighborhood optimization for isometric embedding

Neurocomputing
Using graph algebra to optimize neighborhood for isometric mapping

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Clustering-based nonlinear dimensionality reduction on manifold

PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Performing locally linear embedding with adaptable neighborhood size on manifold

PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Nonlinear dimensionality reduction with hybrid distance for trajectory representation of dynamic texture

Signal Processing
Applications of average geodesic distance in manifold learning

RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
The dynamical neighborhood selection based on the sampling density and manifold curvature for isometric data embedding

Pattern Recognition Letters
Manifold-ranking based retrieval using k-regular nearest neighbor graph

Pattern Recognition
Passage method for nonlinear dimensionality reduction of data on multi-cluster manifolds

Pattern Recognition

Quantified Score

Hi-index	0.14

Visualization

Abstract

Isometric data embedding requires construction of a neighborhood graph that spans all data points so that geodesic distance between any pair of data points could be estimated by distance along the shortest path between the pair on the graph. This paper presents an approach for constructing k-edge-connected neighborhood graphs. It works by finding k edge-disjoint spanning trees the sum of whose total lengths is a minimum. Experiments show that it outperforms the nearest neighbor approach for geodesic distance estimation.