Minimum Determinant Constraint for Non-negative Matrix Factorization

* Final gross prices may vary according to local VAT.

Get Access

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.