Blind Matrix Decomposition Via Genetic Optimization of Sparseness and Nonnegativity Constraints (original) (raw)
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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
- The Message Passing Interface (MPI) standard, http://www.mpi-forum.org
- Baldi, P., Hatfield, W.: DNA Microarrays and Gene Epression. Cambridge University Press, Cambridge (2002)
Google Scholar - Chiapetta, P., Roubaud, M.C., Torrésani, B.: Blind source separation and the analysis of microarray data. J. Comp. Biology 11, 1090–1109 (2004)
Article Google Scholar - Chipperfield, A., Fleming, P., Pohlheim, H., Fonseca, C.: Genetic Algorithm Toolbox. University of Sheffield
Google Scholar - Cichocki, A., Amari, S.-I.: Adaptive Blind Signal and Image Processing. John Wiley & Sons, England (2002)
Google Scholar - The Gene Onkology Consortium. Gene ontologie: Tool for the unification of biology. Nature Genetics 25, 25–29 (2000)
Google Scholar - The Gene Onkology Consortium. Creating the gene ontology resource: design and implementation. Genome Research 11, 1425–1433 (2001)
Google Scholar - Diamantaras, K.I., Kung, S.Y.: Principal Component Neural Networks, Theory and Applications. Wiley, Chichester (1996)
MATH Google Scholar - Hoyer, P.O.: Non-negative matrix factorization with sparseness constraints. J. Machine Learning Research 5, 1457–1469 (2004)
Google Scholar - http://www.mpi-forum.org/docs/mpi-20-html/mpi2report.html MPI-2: Extensions to the Message-Passing Interface, www.mpi-forum.org
- Hyvärinen, A., Karhunen, J., Oja, E.: Independent Componenet Analysis. John Wiley & Sons, England (2001)
Google Scholar - Hyvärinen, A., Oja, E., Hoyer, P., Hurri, J.: Image feature extraction by sparse coding and independent component analysis. In: Proc. ICPR 1998 (1998)
Google Scholar - Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 401, 788–791 (1999)
Article Google Scholar - Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. In: Advances in Neural Information Processing 13 (NIPS’2000), MIT Press, Masachusetts (2001)
Google Scholar - Lee, S.-I., Batzoglou, S.: Application of independent component analysis to microarrays. Genome Biology 4, R76.1–R76.21 (2003)
Google Scholar - Lewicki, M.S., Sejnowski, T.J.: Learning overcomplete representations. Neural Computation 12, 337–365 (2000)
Article Google Scholar - Li, Y., Cichocki, A., Amari, S.: Analysis of sparse representation and blind source separation. Neural Computation 16, 1193–1234 (2004)
Article MATH Google Scholar - Lutter, D., Stadlthanner, K., Theis, F.J., Lang, E.W., Tomé, A.M., Becker, B., Vogt, T.: Analyzing gene expression profiles with ica. In: Ruggiero, C. (ed.) Proc. BIOMED 2006, Canada, Acta Press (2006)
Google Scholar - Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Heidelberg (1999)
Google Scholar - Ohlshausen, B.A., Field, D.J.: Natural image statistics and efficient coding. Network: Computation in Neural Systems 7, 333–339 (1996)
Article Google Scholar - Quackenbush, J.: Computational analysis of microarray data. Nature 2, 418–427 (2001)
Google Scholar - Ruderman, D.: The statistics of natural images. Network: Computations in Neural Systems 5, 517–548 (1994)
Article MATH Google Scholar - Saidi, S.A, Holland, C.M., Kreil, D.P., MacKay, D.J.C., Charnock-Jones, D.S., Print, C.G., Smith, S.K.: Independent component analysis for gene arrays. Oncogene 23, 6677–6683 (2004)
Article Google Scholar
Author information
Authors and Affiliations
- Institute of Biophysics, University of Regensburg, 93040 Regensburg, Germany
Kurt Stadlthanner, Fabian J. Theis & Elmar W. Lang - DETI / IEETA, Universidade de Aveiro, 3810-Aveiro, Portugal
Ana Maria Tomé - DATC, Universidad de Granada, E-18071 Granada, Spain
Carlos G. Puntonet
Authors
- Kurt Stadlthanner
- Fabian J. Theis
- Elmar W. Lang
- Ana Maria Tomé
- Carlos G. Puntonet
Editor information
Joaquim Marques de Sá Luís A. Alexandre Włodzisław Duch Danilo Mandic
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stadlthanner, K., Theis, F.J., Lang, E.W., Tomé, A.M., Puntonet, C.G. (2007). Blind Matrix Decomposition Via Genetic Optimization of Sparseness and Nonnegativity Constraints. In: de Sá, J.M., Alexandre, L.A., Duch, W., Mandic, D. (eds) Artificial Neural Networks – ICANN 2007. ICANN 2007. Lecture Notes in Computer Science, vol 4668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74690-4\_81
Download citation
- .RIS
- .ENW
- .BIB
- DOI: https://doi.org/10.1007/978-3-540-74690-4\_81
- Publisher Name: Springer, Berlin, Heidelberg
- Print ISBN: 978-3-540-74689-8
- Online ISBN: 978-3-540-74690-4
- eBook Packages: Computer ScienceComputer Science (R0)Springer Nature Proceedings Computer Science
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.