An improved local tangent space alignment method for manifold learning

Authors:
Peng Zhang;Hong Qiao;Bo Zhang
Affiliations:
Institute of Applied Mathematics, AMSS, Chinese, Academy of Sciences, Beijing 100190, China;Institute of Automation, Chinese Academy of Sciences, Beijing 100190, China;Institute of Applied Mathematics, AMSS, Chinese, Academy of Sciences, Beijing 100190, China and State Key Laboratory of Scientific and Engineering Computing, AMSS, Chinese Academy of Sciences, Bei ...
Venue:
Pattern Recognition Letters
Year:
2011

Citing 4
Cited 3

Laplacian Eigenmaps for dimensionality reduction and data representation

Neural Computation
Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment

SIAM Journal on Scientific Computing
Intrinsic dimension estimation of manifolds by incising balls

Pattern Recognition
Local smoothing for manifold learning

CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition

A new embedding quality assessment method for manifold learning

Neurocomputing
A comparative study of nonlinear manifold learning methods for cancer microarray data classification

Expert Systems with Applications: An International Journal
A multi-manifold semi-supervised Gaussian mixture model for pattern classification

Pattern Recognition Letters

Quantified Score

Hi-index	0.10

Visualization

Abstract

Principal component analysis (PCA) is widely used in recently proposed manifold learning algorithms to provide approximate local tangent spaces. However, such approximations provided by PCA may be inaccurate when local neighborhoods of the data manifold do not lie in or close to a linear subspace. Furthermore, the approximated tangent spaces can not fit the change in data distribution density. In this paper, a new method is proposed for providing faithful approximations to the local tangent spaces of a data manifold, which is proved to be more accurate than PCA. With this new method, an improved local tangent space alignment (ILTSA) algorithm is developed, which can efficiently recover the geometric structure of data manifolds even in the case when data are sparse or non-uniformly distributed. Experimental results are presented to illustrate the better performance of ILTSA on both synthetic data and image data.