Convergence analysis of a deterministic discrete time system of feng's MCA learning algorithm

Authors:
Dezhong Peng;Zhang Yi
Affiliations:
Coll. of Comput. Sci. & Eng., Univ. of Electron. Sci. & Technol. of China;-
Venue:
IEEE Transactions on Signal Processing
Year:
2006

Citing 0
Cited 6

Convergence analysis of the OJAn MCA learning algorithm by the deterministic discrete time method

Theoretical Computer Science
Convergence analysis of a simple minor component analysis algorithm

Neural Networks
Letters: A neural networks learning algorithm for minor component analysis and its convergence analysis

Neurocomputing
On the discrete time dynamics of a self-stabilizing MCA learning algorithm

Mathematical and Computer Modelling: An International Journal
A unified convergence analysis of Normalized PAST algorithms for estimating principal and minor components

Signal Processing
Convergence analysis for feng's MCA neural network learning algorithm

ISNN'13 Proceedings of the 10th international conference on Advances in Neural Networks - Volume Part I

Quantified Score

Hi-index	35.68

Visualization

Abstract

The convergence of minor-component analysis (MCA) algorithms is an important issue with bearing on the use of these methods in practical applications. This correspondence studies the convergence of Feng's MCA learning algorithm via a corresponding deterministic discrete-time (DDT) system. Some sufficient convergence conditions are obtained for Feng's MCA learning algorithm with constant learning rate. Simulations are carried out to illustrate the theory