Referenced Items are not available for this document.
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
Published in:
Signal Processing, IEEE Transactions on
(Volume:54
,
Issue:
9
)
Date of Publication: Sept. 2006
- Page(s):
- 3626 - 3632
- ISSN :
- 1053-587X
- INSPEC Accession Number:
- 9052269
- Digital Object Identifier :
- 10.1109/TSP.2006.877662
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 21 August 2006
- Issue Date :
- Sept. 2006
- Sponsored by :
- IEEE Signal Processing Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
