Convergence analysis of a simple minor component analysis algorithm

Minor component analysis (MCA) is a powerful statistical tool for signal processing and data analysis. Convergence of MCA learning algorithms is an important issue in practical applications. In this paper, we will propose a simple MCA learning algorithm to extract minor component from input signals. Dynamics of the proposed MCA learning algorithm are analysed using a corresponding deterministic discrete time (DDT) system. It is proved that almost all trajectories of the DDT system will converge to minor component if the learning rate satisfies some mild conditions and the trajectories start from points in an invariant set. Simulation results will be furnished to illustrate the theoretical results achieved.

[1]  Erkki Oja,et al.  Modified Hebbian learning for curve and surface fitting , 1992, Neural Networks.

[2]  Sabine Van Huffel,et al.  The MCA EXIN neuron for the minor component analysis , 2002, IEEE Trans. Neural Networks.

[3]  Mao Ye,et al.  Convergence analysis of a deterministic discrete time system of feng's MCA learning algorithm , 2005, IEEE Transactions on Signal Processing.

[4]  J. Griffiths.  Adaptive array processing. A tutorial , 1983 .

[5]  Qingfu Zhang,et al.  On the discrete-time dynamics of a PCA learning algorithm , 2003, Neurocomputing.

[6]  Zheng Bao,et al.  Total least mean squares algorithm , 1998, IEEE Trans. Signal Process..

[7]  Pedro J. Zufiria,et al.  On the discrete-time dynamics of the basic Hebbian neural network node , 2002, IEEE Trans. Neural Networks.

[8]  Richard Klemm,et al.  Adaptive airborne MTI: an auxiliary channel approach , 1987 .

[9]  Sergio Barbarossa,et al.  Comparison of optimum and linear prediction techniques for clutter cancellation , 1987 .

[10]  Lennart Ljung,et al.  Analysis of recursive stochastic algorithms , 1977 .

[11]  Wei Xing Zheng,et al.  Neural network learning algorithms for tracking minor subspace in high-dimensional data stream , 2005, IEEE Transactions on Neural Networks.

[12]  Vwani P. Roychowdhury,et al.  Algorithms for accelerated convergence of adaptive PCA , 2000, IEEE Trans. Neural Networks Learn. Syst..

[13]  Ralf Möller,et al.  A Self-Stabilizing Learning Rule for Minor Component Analysis , 2004, Int. J. Neural Syst..

[14]  Qingfu Zhang,et al.  A class of learning algorithms for principal component analysis and minor component analysis , 2000, IEEE Trans. Neural Networks Learn. Syst..

[15]  Giansalvo Cirrincione,et al.  Against the convergence of the minor component analysis neurons , 1999, IEEE Trans. Neural Networks.

[16]  Shun-ichi Amari,et al.  Unified stabilization approach to principal and minor components extraction algorithms , 2001, Neural Networks.

[17]  M. Swamy,et al.  Learning algorithm for total least-squares adaptive signal processing , 1992 .

[18]  Erkki Oja,et al.  Principal components, minor components, and linear neural networks , 1992, Neural Networks.

[19]  Dezhong Peng,et al.  Convergence analysis of a deterministic discrete time system of feng's MCA learning algorithm , 2006, IEEE Trans. Signal Process..

[20]  Zheng Bao,et al.  Adaptive minor component extraction with modular structure , 2001, IEEE Trans. Signal Process..

[21]  R. O. Schmidt,et al.  Multiple emitter location and signal Parameter estimation , 1986 .

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