Sparse nonnegative matrix factorization with genetic algorithms for microarray analysis

K. Stadlthanner, D. Lutter, F. J. Theis, E. W. Lang, A. M. Tomé, P. Georgieva, C. G. Puntonet

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations

Abstract

Nonnegative Matrix Factorization (NMF) has proven to be a useful tool for the analysis of nonnegative multivariate data. Gene expression profiles naturally conform to assumptions about data formats raised by NMF. However, it is known not to lead to unique results concerning the component signals extracted. In this paper we consider an extension of the NMF algorithm which provides unique solutions whenever the underlying component signals are sufficiently sparse. A new sparseness measure is proposed most appropriate to suitably transformed gene expression profiles. The resulting fitness function is discontinuous and exhibits many local minima, hence we use a genetic algorithm for its optimization. The algorithm is applied to toy data to investigate its properties as well as to a microarray data set related to Pseudo-Xanthoma Elasticum (PXE).

Original languageEnglish
Title of host publicationThe 2007 International Joint Conference on Neural Networks, IJCNN 2007 Conference Proceedings
Pages294-299
Number of pages6
DOIs
StatePublished - 2007
Externally publishedYes
Event2007 International Joint Conference on Neural Networks, IJCNN 2007 - Orlando, FL, United States
Duration: 12 Aug 200717 Aug 2007

Publication series

NameIEEE International Conference on Neural Networks - Conference Proceedings
ISSN (Print)1098-7576

Conference

Conference2007 International Joint Conference on Neural Networks, IJCNN 2007
Country/TerritoryUnited States
CityOrlando, FL
Period12/08/0717/08/07

Fingerprint

Dive into the research topics of 'Sparse nonnegative matrix factorization with genetic algorithms for microarray analysis'. Together they form a unique fingerprint.

Cite this