Non-negative matrix factorization (NMF) provides the advantage of parts-based data representation through additive only combinations. It has been widely adopted in areas like item recommending, text mining, data clustering, speech denoising, etc. In this paper, we provide an algorithm that allows the factorization to have linear or approximately linear constraints with respect to each factor. We prove that if the constraint function is linear, algorithms within our multiplicative framework will converge. This theory supports a large variety of equality and inequality constraints, and can facilitate application of NMF to a much larger domain. Taking the recommender system as an example, we demonstrate how a specialized weighted and constrained NMF algorithm can be developed to fit exactly for the problem, and the tests justify that our constraints improve the performance for both weighted and unweighted NMF algorithms under several different metrics. In particular, on the Movie lens data with 94\% of items, the Constrained NMF improves recall rate 3\% compared to SVD50 and 45\% compared to SVD150, which were reported as the best two in the top-N metric.
['Chengbin Peng', 'Ka-Chun Wong', 'Alyn Rockwood', 'Xiangliang Zhang', 'Jinling Jiang', 'David E. Keyes']
Multiplicative Algorithms for Constrained Non-negative Matrix Factorization