A Discrete-Time Neurodynamic Approach to Sparsity-Constrained Nonnegative Matrix Factorization

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journal

View graph of relations


Original languageEnglish
Pages (from-to)1531-1562
Number of pages32
Journal / PublicationNeural Computation
Issue number8
Online published15 Jul 2020
Publication statusPublished - Aug 2020


Sparsity is a desirable property in many nonnegative matrix factorization (NMF) applications. Although some level of sparseness of NMF solutions can be achieved by using regularization, the resulting sparsity depends highly on the regularization parameter to be valued in an ad hoc way. In this letter we formulate sparse NMF as a mixed-integer optimization problem with sparsity as binary constraints. A discrete-time projection neural network is developed for solving the formulated problem. Sufficient conditions for its stability and convergence are analytically characterized by using Lyapunov's method. Experimental results on sparse feature extraction are discussed to substantiate the superiority of this approach to extracting highly sparse features.