Noise-Removal Method for Manifold Learning

Manifold learning algorithms are nonlinear dimensionality reduction methods which could find the intrinsic geometry structure of the data points and recover the latent main factors that influence object changes. However, noise is unavoidable for datasets in the process of sampling. The noisy data easily get wrong results when using manifold learning algorithms. This paper proposes a noisy-data pre-processing method for manifold learning algorithms. Firstly, we utilize shrink strategy and adopt the eigenvalue linear criterion to find the tangent hyperplane of each data point. Then, we construct the local coordinate system for each tangent hyperplane and get the projection coordinates of each data point. Finally, we reconstruct the high-dimensional coordinates of each data point by affine transformation. The experiments show that the proposed method is effective and useful.

[1]  Matthew Brand,et al.  Charting a Manifold , 2002, NIPS.

[2]  Wen Gao,et al.  Maximal Linear Embedding for Dimensionality Reduction , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Hongyuan Zha,et al.  Adaptive Manifold Learning , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Fatih Murat Porikli,et al.  Pedestrian Detection via Classification on Riemannian Manifolds , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Alfredo Vellido,et al.  The effect of noise and sample size on an unsupervised feature selection method for manifold learning , 2008, 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence).

[6]  Mikhail Belkin,et al.  Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering , 2001, NIPS.

[7]  D. Donoho,et al.  Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Ahmed M. Elgammal,et al.  Tracking People on a Torus , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  J. Tenenbaum,et al.  A global geometric framework for nonlinear dimensionality reduction. , 2000, Science.

[10]  Hongbin Zha,et al.  Riemannian Manifold Learning , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  H. Zha,et al.  Principal manifolds and nonlinear dimensionality reduction via tangent space alignment , 2004, SIAM J. Sci. Comput..

[12]  S T Roweis,et al.  Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.