title: A globally convergent MC algorithm with an adaptive learning rate.
abstract: 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.
authors.forename: Dezhong
authors.initials: D
authors.lastname: Peng
authors.forename: Zhang
authors.initials: Z
authors.lastname: Yi
authors.forename: Yong
authors.initials: Y
authors.lastname: Xiang
authors.forename: Haixian
authors.initials: H
authors.lastname: Zhang
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D005246:Feedback; D015233:Models, Statistical; D016571:Neural Networks, Computer; D010363:Pattern Recognition, Automated / Q000379:methods*; D025341:Principal Component Analysis