CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2006 vol.28 Issue No.03 - March
Issue No.03 - March (2006 vol.28)
J.M. Carazo , IEEE
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPAMI.2006.60
We propose a novel nonnegative matrix factorization model that aims at finding localized, part-based, representations of nonnegative multivariate data items. Unlike the classical nonnegative matrix factorization (NMF) technique, this new model, denoted "nonsmooth nonnegative matrix factorization” (nsNMF), corresponds to the optimization of an unambiguous cost function designed to explicitly represent sparseness, in the form of nonsmoothness, which is controlled by a single parameter. In general, this method produces a set of basis and encoding vectors that are not only capable of representing the original data, but they also extract highly localized patterns, which generally lend themselves to improved interpretability. The properties of this new method are illustrated with several data sets. Comparisons to previously published methods show that the new nsNMF method has some advantages in keeping faithfulness to the data in the achieving a high degree of sparseness for both the estimated basis and the encoding vectors and in better interpretability of the factors.
Index Terms- nonnegative matrix factorization, constrained optimization, datamining, mining methods and algorithms, pattern analysis, feature extraction or construction, sparse, structured, and very large systems.
J.M. Carazo, Kieko Kochi, Dietrich Lehmann, Roberto D. Pascual-Marqui, "Nonsmooth Nonnegative Matrix Factorization (nsNMF)", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.28, no. 3, pp. 403-415, March 2006, doi:10.1109/TPAMI.2006.60