Aiming at the lack of sparseness of factorization matrix in the nonnegative matrix factorization (NMF) algorithm,a new constrained NMF algorithm was proposed.A sparseness constraint was added to the original nonnegative matrix factorization (NMF) algorithm,and the minimum correlation constraint was imposed on the coefficient matrices and the 2-norm constraint was imposed on the basis matrix at the same time,which can ensure the non-negative constraint and accurate decomposition,and can also make the decomposed matrix sparse as far as possible,saving more storage space.Comparison with the experiments showed that the propose algorithm has the better sparseness and smaller error than both the original NMF algorithm and the SNMF algorithm.
