.png){kind=icon}
.png){kind=icon}
Return
Hybridizing sparse component analysis with genetic algorithms for microarray analysis
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2007.09.017.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2008 Elsevier B.V. All rights reserved.
Keywords:
sparse nonnegative matrix factorization
blind source separation
gene microarray analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
View more organizations