A Feature Space Alignment Learning Algorithm

Manifold learning algorithms have been proved to be effective in pattern recognition, image analysis and data mining etc. The local tangent space alignment (LTSA) algorithm is a representative manifold learning method for dimension reduction. However, datasets cannot preserve their original features very well after dimension reduction by LTSA, due to the deficiency of local subspace construction in LTSA, especially when data dimensionality is large. To solve this problem, a novel subspace manifold learning algorithm called feature space alignment learning (FSAL in short) is proposed in this paper. In this algorithm, we employ candid covariance-free independent principal component analysis (CCIPCA) as a preprocessing step. Experiments over artificial and real datasets validate the effectiveness of the proposed method.

[1]  Mikhail Belkin,et al.  Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.

[2]  Erkki Oja,et al.  Subspace methods of pattern recognition , 1983 .

[3]  E. Oja,et al.  On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrix , 1985 .

[4]  F. W. Kellaway,et al.  Advanced Engineering Mathematics , 1969, The Mathematical Gazette.

[5]  Ke Lu,et al.  Locality pursuit embedding , 2004, Pattern Recognition.

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

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

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

[9]  Juyang Weng,et al.  Candid Covariance-Free Incremental Principal Component Analysis , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Alex Pentland,et al.  Face recognition using eigenfaces , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.