A new local PCA-SOM algorithm

Authors:
Dong Huang;Zhang Yi;Xiaorong Pu
Affiliations:
Computational Intelligence Laboratory, School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 610054, PR China;Computational Intelligence Laboratory, School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 610054, PR China;Computational Intelligence Laboratory, School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 610054, PR China
Venue:
Neurocomputing
Year:
2008

Citing 9
Cited 2

Dimension reduction by local principal component analysis

Neural Computation
Soft vector quantization and the EM algorithm

Neural Networks
Nonlinear component analysis as a kernel eigenvalue problem

Neural Computation
Mixtures of probabilistic principal component analyzers

Neural Computation
Learning and Design of Principal Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
Self-organizing continuous attractor networks and motor function

Neural Networks
Robust recursive least squares learning algorithm for principal component analysis

IEEE Transactions on Neural Networks
Local PCA algorithms

IEEE Transactions on Neural Networks
The parameterless self-organizing map algorithm

IEEE Transactions on Neural Networks

Learning nonlinear manifolds based on mixtures of localized linear manifolds under a self-organizing framework

Neurocomputing
Principal component analysis based on non-parametric maximum entropy

Neurocomputing

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper proposes a local PCA-SOM algorithm. The new competition measure is computational efficient, and implicitly incorporates the Mahalanobis distance and the reconstruction error. The matrix inversion or PCA decomposition for each data input is not needed as compared to the previous models. Moreover, the local data distribution is completely stored in the covariance matrix instead of the pre-defined numbers of the principal components. Thus, no priori information of the optimal principal subspace is required. Experiments on both the synthesis data and a pattern learning task are carried out to show the performance of the proposed method.