A feature space alignment learning algorithm

Authors:
Chao Tan;Jihong Guan
Affiliations:
Department of Computer Science and Technology, Tongji University, Shanghai, China;Department of Computer Science and Technology, Tongji University, Shanghai, China
Venue:
PRICAI'12 Proceedings of the 12th Pacific Rim international conference on Trends in Artificial Intelligence
Year:
2012

Citing 3
Cited 0

Laplacian Eigenmaps for dimensionality reduction and data representation

Neural Computation
Candid Covariance-Free Incremental Principal Component Analysis

IEEE Transactions on Pattern Analysis and Machine Intelligence
Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment

SIAM Journal on Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.