论文信息 - Local PCA algorithms

Local PCA algorithms

Within the last years various principal component analysis (PCA) algorithms have been proposed. In this paper we use a general framework to describe those PCA algorithms which are based on Hebbian learning. For an important subset of these algorithms, the local algorithms, we fully describe their equilibria, where all lateral connections are set to zero and their local stability. We show how the parameters in the PCA algorithms have to be chosen in order to get an algorithm which converges to a stable equilibrium which provides principal component extraction.

Kurt Hornik | Andreas Weingessel

[1] P. Foldiak,et al. Adaptive network for optimal linear feature extraction , 1989, International 1989 Joint Conference on Neural Networks.

[2] T. Leen. Dynamics of learning in linear feature-discovery networks , 1991 .

[3] A. Hurwitz. Ueber die Bedingungen, unter welchen eine Gleichung nur Wurzeln mit negativen reellen Theilen besitzt , 1895 .

[4] Kurt Hornik,et al. Learning in linear neural networks: a survey , 1995, IEEE Trans. Neural Networks.

[5] Kurt Hornik,et al. Convergence analysis of local feature extraction algorithms , 1992, Neural Networks.

[6] H. Hotelling. Analysis of a complex of statistical variables into principal components. , 1933 .

[7] J. Magnus,et al. Matrix Differential Calculus with Applications in Statistics and Econometrics (Revised Edition) , 1999 .

[8] E. Oja. Simplified neuron model as a principal component analyzer , 1982, Journal of mathematical biology.

[9] Sun-Yuan Kung,et al. Principal Component Neural Networks: Theory and Applications , 1996 .

[10] J. Rubner,et al. A Self-Organizing Network for Principal-Component Analysis , 1989 .

[11] Sun-Yuan Kung,et al. A neural network learning algorithm for adaptive principal component extraction (APEX) , 1990, International Conference on Acoustics, Speech, and Signal Processing.