Blind matrix decomposition via genetic optimization of sparseness and nonnegativity constraints

Authors:
Kurt Stadlthanner;Fabian J. Theis;Elmar W. Lang;Ana Maria Tomé;Carlos G. Puntonet
Affiliations:
Institute of Biophysics, University of Regensburg, Regensburg, Germany;Institute of Biophysics, University of Regensburg, Regensburg, Germany;Institute of Biophysics, University of Regensburg, Regensburg, Germany;DETI/IEETA, Universidade de Aveiro, Aveiro, Portugal;DATC, Universidad de Granada, Granada, Spain
Venue:
ICANN'07 Proceedings of the 17th international conference on Artificial neural networks
Year:
2007

Citing 8
Cited 0

Principal component neural networks: theory and applications

Principal component neural networks: theory and applications
Genetic Algorithms Plus Data Structures Equals Evolution Programs

Genetic Algorithms Plus Data Structures Equals Evolution Programs
Adaptive Blind Signal and Image Processing: Learning Algorithms and Applications

Adaptive Blind Signal and Image Processing: Learning Algorithms and Applications
Image Feature Extraction by Sparse Coding and Independent Component Analysis

ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 2 - Volume 2
Analysis of sparse representation and blind source separation

Neural Computation
Non-negative Matrix Factorization with Sparseness Constraints

The Journal of Machine Learning Research
Learning Overcomplete Representations

Neural Computation
Analyzing gene expression profiles with ICA

BioMed'06 Proceedings of the 24th IASTED international conference on Biomedical engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 nonnegative Blind Source Separation (BSS) problems. In this paper we present first results of an extension to the NMF algorithm which solves the BSS problem when the underlying sources are sufficiently sparse. As the proposed target function is discontinuous and possesses many local minima, we use a genetic algorithm for its minimization. Application to a microarray data set will be considered also.