By Topic

A Modified Oja–Xu MCA Learning Algorithm and Its Convergence Analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dezhong Peng ; Comput. Intelligence Lab., Univ. of Electron. Sci. & Technol. of China, Chengdu ; Zhang Yi

The original Oja-Xu minor component analysis (MCA) learning algorithm is not convergent. This brief shows that by modifying Oja-Xu MCA learning algorithm with a normalization step the modified one could be convergent subject to some conditions satisfied. The convergence of the modified MCA learning algorithm is studied by analyzing the convergence of an associated deterministic discrete time system. Necessary and sufficient conditions for convergence are obtained. Simulations further confirm the results

Published in:

IEEE Transactions on Circuits and Systems II: Express Briefs  (Volume:54 ,  Issue: 4 )