Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Think globally, fit locally: unsupervised learning of low dimensional manifolds
The Journal of Machine Learning Research
Distance-Preserving Projection of High-Dimensional Data for Nonlinear Dimensionality Reduction
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Sammon's Nonlinear Mapping Using Geodesic Distances
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
Building k Edge-Disjoint Spanning Trees of Minimum Total Length for Isometric Data Embedding
IEEE Transactions on Pattern Analysis and Machine Intelligence
Building k-edge-connected neighborhood graph for distance-based data projection
Pattern Recognition Letters
Curvilinear component analysis: a self-organizing neural network for nonlinear mapping of data sets
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
As an effective way for dimensionality reduction, data embedding has direct applications in data mining, data indexing and searching, information retrieval, and multimedia data processing. As two representative techniques for data embedding, both Isomap and LLE require the construction of neighborhood graphs on which every point is connected to its neighbors. This paper reviews several techniques that have been developed to construct connected neighborhood graphs. These methods have made Isomap and LLE applicable to a wide range of data including under-sampled data and non-uniformly distributed data. Application-related issues of data embedding techniques are also discussed.