Hybridizing sparse component analysis with genetic algorithms for microarray analysis

• Autor(a) principal: Stadlthanner, K.
• Data de Publicação: 2008
• Outros Autores: Theis, F. J., Lang, E. W., Tomé, A. M., Puntonet, C. G., Górriz, J. M.
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
• Texto Completo: http://hdl.handle.net/10773/5819
• topic: Sparse nonnegative matrix factorization; Blind source separation; Gene microarray analysis

Nonnegative Matrix Factorization (NMF) has proven to be a useful tool for the analysis of nonnegative multivariate data. However, it is known not to lead to unique results when applied to Blind Source Separation (BSS) problems. In this paper we present an extension of NMF capable of solving the BSS problem when the underlying sources are sufficiently sparse. In contrast to most well-established BSS methods, the devised algorithm is capable of solving the BSS problem in cases where the underlying sources are not independent or uncorrelated. As the proposed fitness function is discontinuous and possesses many local minima, we use a genetic algorithm for its minimization. Finally, we apply the devised algorithm to real world microarray data.