A modified multiplicative update algorithm for euclidean distance-based nonnegative matrix factorization and its global convergence

Abstract

Nonnegative matrix factorization (NMF) is to approximate a given large nonnegative matrix by the product of two small nonnegative matrices. Although the multiplicative update algorithm is widely used as an efficient computation method for NMF, it has a serious drawback that the update formulas are not well-defined because they are expressed in the form of a fraction. Furthermore, due to this drawback, the global convergence of the algorithm has not been guaranteed. In this paper, we consider NMF in which the approximation error is measured by the Euclidean distance between two matrices. We propose a modified multiplicative update algorithm in order to overcome the drawback of the original version and prove its global convergence. © 2011 Springer-Verlag.