Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
Independent component analysis for identification of artifacts in magnetoencephalographic recordings
NIPS '97 Proceedings of the 1997 conference on Advances in neural information processing systems 10
Linear geometric ICA: fundamentals and algorithms
Neural Computation
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
The Journal of Machine Learning Research
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Learning Overcomplete Representations
Neural Computation
Analyzing gene expression profiles with ICA
BioMed'06 Proceedings of the 24th IASTED international conference on Biomedical engineering
Denoising using local projective subspace methods
Neurocomputing
IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part I: Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira's Scientific Legacy
Towards unique solutions of non-negative matrix factorization problems by a determinant criterion
Digital Signal Processing
Hi-index | 0.01 |
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.