A globally convergent MC algorithm with an adaptive learning rate
Peng, Dezhong, Yi, Zhang, Xiang, Yong and Zhang, Haixian 2012, A globally convergent MC algorithm with an adaptive learning rate, IEEE transactions on neural networks and learning systems, vol. 23, no. 2, pp. 359-365.
Attached Files
Name
Description
MIMEType
Size
Downloads
Title
A globally convergent MC algorithm with an adaptive learning rate
This brief deals with the problem of minor component analysis (MCA). Artificial neural networks can be exploited to achieve the task of MCA. Recent research works show that convergence of neural networks based MCA algorithms can be guaranteed if the learning rates are less than certain thresholds. However, the computation of these thresholds needs information about the eigenvalues of the autocorrelation matrix of data set, which is unavailable in online extraction of minor component from input data stream. In this correspondence, we introduce an adaptive learning rate into the OJAn MCA algorithm, such that its convergence condition does not depend on any unobtainable information, and can be easily satisfied in practical applications.
Language
eng
Field of Research
089999 Information and Computing Sciences not elsewhere classified
Socio Economic Objective
970108 Expanding Knowledge in the Information and Computing Sciences
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.