Résumé
In this paper we address the problem of asynchronous distributed principal component analysis. We provide several algorithms coping with different situations according to the underlying graph structure. A general enough framework allows us to analyze all these algorithms at the same time. Convergence is proved with probability 1 under suitable assumptions, and numerical experiments illustrate their good behavior.
| langue originale | Anglais |
|---|---|
| Numéro d'article | 6425898 |
| Pages (de - à) | 1398-1403 |
| Nombre de pages | 6 |
| journal | Proceedings of the IEEE Conference on Decision and Control |
| Les DOIs | |
| état | Publié - 1 janv. 2012 |
| Evénement | 51st IEEE Conference on Decision and Control, CDC 2012 - Maui, HI, États-Unis Durée: 10 déc. 2012 → 13 déc. 2012 |
Empreinte digitale
Examiner les sujets de recherche de « Asynchronous distributed principal component analysis using stochastic approximation ». Ensemble, ils forment une empreinte digitale unique.Contient cette citation
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver