Loading [a11y]/accessibility-menu.js
On relative convergence properties of principal component analysis algorithms | IEEE Journals & Magazine | IEEE Xplore

On relative convergence properties of principal component analysis algorithms


Abstract:

We investigate the convergence properties of two different stochastic approximation algorithms for principal component analysis, and analytically explain some commonly ob...Show More

Abstract:

We investigate the convergence properties of two different stochastic approximation algorithms for principal component analysis, and analytically explain some commonly observed experimental results. In our analysis, we use the theory of stochastic approximation, and in particular the results of Fabian (1968), to explore the asymptotic mean square errors (AMSEs) of the algorithms. This study reveals the conditions under which the algorithms produce smaller AMSEs, and also the conditions under which one algorithm has a smaller AMSE than the other. Experimental study with multidimensional Gaussian data corroborate our analytical findings. We next explore the convergence rates of the two algorithms. Our experiments and an analytical explanation reveals the conditions under which the algorithms converge faster to the solution, and also the conditions under which one algorithm converges faster than the other.
Published in: IEEE Transactions on Neural Networks ( Volume: 9, Issue: 2, March 1998)
Page(s): 319 - 329
Date of Publication: 31 March 1998

ISSN Information:

PubMed ID: 18252455

References

References is not available for this document.