A modified oja-xu MCA learning algorithm and its convergence analysis

IEEE Transactions on Circuits and Systems II: Express Briefs

Volumn 54, Issue 4, 2007, Pages 348-352

  Peng, Dezhong ^a   Yi, Zhang ^a  

^a UNIVERSITY OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

Deterministic discrete time (DDT) system; eigen value; eigenvector; minor component analysis (MCA); neural networks

Indexed keywords

COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; DISCRETE TIME CONTROL SYSTEMS; EIGENVALUES AND EIGENFUNCTIONS; NEURAL NETWORKS;

MINOR COMPONENT ANALYSIS; NORMALIZATION STEP;

LEARNING ALGORITHMS;

EID: 34247363530     PISSN: 15497747     EISSN: 15583791     Source Type: Journal    
DOI: 10.1109/TCSII.2006.889709     Document Type: Article

References (15)

1. G. Cirrincione, M. Cirrincione, J. Herault, and S. V. Huffel, “The MCA EXIN neuron for the minor component analysis,” IEEE Trans. Neural Netw., vol. 13, no. 1, pp. 160–187, Jan. 2002.
2. L. Xu, E. Oja, and C. Suen, “Modified Hebbian learning for curve and surface fitting,” Neural Netw., vol. 5, pp. 441–457, 1992.
3. P. A. Thompson, “An adaptive spectral analysis technique for unbiased frequency estimation in the presence of white noise,” in Proc. 13thAsilomar Conf. Circuits, System Computation, Pacific Grove, CA, 1979, pp. 529–533.
4. J. F. Yang and M. Kaveh, “Adaptive eigensubspace algorithms for direction or frequency estimation and tracking,” IEEE Trans. Acoust., Speech, Signal Process., vol. 36, no. 2, pp. 241–251, Feb. 1988.
5. F. Luo, R. Unbehauen, and A. Cichocki, “A minor component analysis algorithm,” Neural Netw., vol. 10, no. 2, pp. 291–297, 1997.
6. E. Oja, “Principal components, minor components and linear neural networks,” Neural Netw., vol. 5, pp. 927–935, 1992.
7. T. Chen, S. Amari, and Q. Fin, “A unified algorithm for principal and minor components extraction,” Neural Netw., vol. 11, pp. 385–390, 1998.
8. D. Liu, S. Hu, and J. Wang, “Global output convergence of a class of continuous-time recurrent neural networks with time-varying thresholds,” IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 51, no. 4, pp. 161–167, Apr. 2004.
9. H. Lu and G. Chen, “Global exponential convergence of multitime-scale neural networks,” IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 52, no. 11, pp. 761–765, Nov. 2005.
10. L. Ljung, “Aanlysis of recursive stochastic algorithms,” IEEE Trans. Autom. Contr., vol. AC-22, no. 3, pp. 551–575, Mar. 1977.
11. P. J. Zufiria, “On the discrete-time dynamics of the basic Hebbian neural-network nodes,” IEEE Trans. Neural Netw., vol. 13, no. 6, pp. 1342–1352, Nov. 2002.
12. Z. Yi, M. Ye, J. C. Lv, and K. K. Tan, “Convergence analysis of a deterministic discrete time system of Oja's PCA learning algorithm,” IEEE Trans. Neural Netw., to be published.
13. Q. Zhang, “On the discrete-time dynamics of a PCA learning algorithm,” Neurocomput., vol. 55, pp. 761–769, 2003.
14. J. Lv, M. Ye, and Z. Yi, “Convergence analysis for Oja+ MCA learning algorithm,” Lecture Notes Comp. Sci., vol. 3173, pp. 810–815, 2004.
15. C. Chatterjee, Z. Kang, and V. P. Roychowdhury, “Algorithm for accelerated convergence of adaptive PCA,” IEEE Trans. Neural Netw., vol. 11, no. 2, pp. 338–355, Feb. 2000.