An overview of the asymptotic performance of the family of the FastICA algorithms

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This contribution summarizes the results on the asymptotic performance of several variants of the FastICA algorithm. A number of new closed-form expressions are presented.

Cite

CITATION STYLE

APA

Wei, T. (2015). An overview of the asymptotic performance of the family of the FastICA algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9237, pp. 336–343). Springer Verlag. https://doi.org/10.1007/978-3-319-22482-4_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free