Laplacian Eigenmaps for dimensionality reduction and data representation
Neural Computation
Think globally, fit locally: unsupervised learning of low dimensional manifolds
The Journal of Machine Learning Research
Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment
SIAM Journal on Scientific Computing
Robust Nonlinear Dimensionality Reduction for Manifold Learning
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 02
Robust locally linear embedding
Pattern Recognition
Unsupervised learning of image manifolds by semidefinite programming
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
Improved MinMax cut graph clustering with nonnegative relaxation
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part II
Locally linear embedding: a survey
Artificial Intelligence Review
Locally discriminative topic modeling
Pattern Recognition
Dimensionality reduction by Mixed Kernel Canonical Correlation Analysis
Pattern Recognition
Enhanced fisher discriminant criterion for image recognition
Pattern Recognition
Self-taught dimensionality reduction on the high-dimensional small-sized data
Pattern Recognition
Stability of dimensionality reduction methods applied on artificial hyperspectral images
ICCVG'12 Proceedings of the 2012 international conference on Computer Vision and Graphics
Feature extraction using two-dimensional neighborhood margin and variation embedding
Computer Vision and Image Understanding
Multiple rank multi-linear SVM for matrix data classification
Pattern Recognition
Global plus local: A complete framework for feature extraction and recognition
Pattern Recognition
Hi-index | 0.01 |
Dimensionality reduction is a big challenge in many areas. A large number of local approaches, stemming from statistics or geometry, have been developed. However, in practice these local approaches are often in lack of robustness, since in contrast to maximum variance unfolding (MVU), which explicitly unfolds the manifold, they merely characterize local geometry structure. Moreover, the eigenproblems that they encounter, are hard to solve. We propose a unified framework that explicitly unfolds the manifold and reformulate local approaches as the semi-definite programs instead of the above-mentioned eigenproblems. Three well-known algorithms, locally linear embedding (LLE), laplacian eigenmaps (LE) and local tangent space alignment (LTSA) are reinterpreted and improved within this framework. Several experiments are presented to demonstrate the potential of our framework and the improvements of these local algorithms.