Skip to main content

Minimum Determinant Constraint for Non-negative Matrix Factorization

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5441))

Abstract

We propose a determinant criterion to constrain the solutions of non-negative matrix factorization problems and achieve unique and optimal solutions in a general setting, provided an exact solution exists. We demonstrate with illustrative examples how optimal solutions are obtained using our new algorithm detNMF and discuss the difference to NMF algorithms imposing sparsity constraints.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Paatero, P., Tapper, U.: Positive matrix factorization: a non-negative factor model with optimal utilization of error estimates of data values. Environmetrics 5, 111–126 (1994)

    Article  Google Scholar 

  2. Lee, D., Seung, H.: Learning the parts of objects by non-negative matrix factorization. Nature 401, 788–791 (1999)

    Article  Google Scholar 

  3. Lee, D., Seung, H.: Algorithms for Non-negative Matrix Factorization. In: NIPS, pp. 556–562 (2000)

    Google Scholar 

  4. Hoyer, P.: Non-Negative Sparse Coding. In: Proc. IEEE Workshop on Neural Networks for Signal Processing, Martigny, Switzerland, pp. 557–565 (2002)

    Google Scholar 

  5. Hoyer, P.: Non-negative Matrix Factorization with Sparseness Constraints. Journal of Machine Learning Research 5 (2004)

    Google Scholar 

  6. Cichocki, A., Zdunek, R., Amari, S.-i.: Csiszár’s divergences for non-negative matrix factorization: Family of new algorithms. In: Rosca, J.P., Erdogmus, D., Príncipe, J.C., Haykin, S. (eds.) ICA 2006. LNCS, vol. 3889, pp. 32–39. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Stadlthanner, K., Theis, F.J., Puntonet, C.G., Górriz, J.-M., Tomé, A.M., Lang, E.W.: Hybridizing sparse component analysis with genetic algorithms for blind source separation. In: Oliveira, J.L., Maojo, V., Martín-Sánchez, F., Pereira, A.S. (eds.) ISBMDA 2005. LNCS (LNBI), vol. 3745, pp. 137–148. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Cichocki, A., Zdunek, R., Amari, S.: Nonnegative Matrix and Tensor Factorization. IEEE Signal Processing Magazine, 142–145 (January 2008)

    Google Scholar 

  9. Laurberg, H., Christensen, M.G., Plumbley, M.D., Hansen, L.K., Jensen, S.H.: Theorems on Positive Data: On the Uniqueness of NMF. Computational Intelligence and Neuroscience 2008, article ID 764206, doi:10.1155/2008/764206

    Google Scholar 

  10. Donoho, D., Stodden, V.: When does non-negative matrix factorization give a correct decomposition into parts? In: Proc. NIPS 2003. MIT Press, Cambridge (2004)

    Google Scholar 

  11. Theis, F.J., Stadlthanner, K., Tanaka, T.: First results on uniqueness of sparse non-negative matrix factorization. In: Proc. EUSIPCO, Eurasip (2005)

    Google Scholar 

  12. Berry, M.W., Browne, M., Langville, A.N., Pauca, V.P., Plemmons, R.J.: Algorithms and applications for approximate nonnegative matrix factorization. Computational Statistics & Data Analysis 52(1), 155–173 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Li, S., et al.: Learning Spatially Localized, Parts-Based Representation. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition (2001)

    Google Scholar 

  14. Hopke, P.K.: A guide to positive matrix factorization. Clarkson University (2000), http://www.epa.gov/ttnamti1/files/ambient/pm25/workshop/laymen.pdf

  15. Dhillon, I., Sra, S.: Generalized Nonnegative Matrix Approximations with Bregman Divergences. In: Proc. Neural Information Processing Systems, USA (2005)

    Google Scholar 

  16. Sajda, P., et al.: Recovery of constituent spectra in 3D chemical shift imaging using non-negative matrix fatorization. In: 4th International Symposium on Independent Component Analysis and Blind Signal Separation, pp. 71–76 (2003)

    Google Scholar 

  17. Juvela, M., Lehtinen, K., Paatero, P.: The use of Positive Matrix Factorization in the analysis of molecular line spectra. Mon. Not. R. Astron. Soc. 280, 616–626 (1996)

    Google Scholar 

  18. Miao, L., Qi, H.: Endmember extraction from highly mixed data using minimum volume constrained nonnegative matrix factorization. IEEE Trans. Geosci. Remote Sens. 45(3), 765–777 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schachtner, R., Pöppel, G., Tomé, A.M., Lang, E.W. (2009). Minimum Determinant Constraint for Non-negative Matrix Factorization. In: Adali, T., Jutten, C., Romano, J.M.T., Barros, A.K. (eds) Independent Component Analysis and Signal Separation. ICA 2009. Lecture Notes in Computer Science, vol 5441. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00599-2_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00599-2_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00598-5

  • Online ISBN: 978-3-642-00599-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics