Nonnegative Matrix Factorization: A Comprehensive Review

Citations Over TimeTop 1% of 2012 papers

Abstract

Nonnegative Matrix Factorization (NMF), a relatively novel paradigm for dimensionality reduction, has been in the ascendant since its inception. It incorporates the nonnegativity constraint and thus obtains the parts-based representation as well as enhancing the interpretability of the issue correspondingly. This survey paper mainly focuses on the theoretical research into NMF over the last 5 years, where the principles, basic models, properties, and algorithms of NMF along with its various modifications, extensions, and generalizations are summarized systematically. The existing NMF algorithms are divided into four categories: Basic NMF (BNMF), Constrained NMF (CNMF), Structured NMF (SNMF), and Generalized NMF (GNMF), upon which the design principles, characteristics, problems, relationships, and evolution of these algorithms are presented and analyzed comprehensively. Some related work not on NMF that NMF should learn from or has connections with is involved too. Moreover, some open issues remained to be solved are discussed. Several relevant application areas of NMF are also briefly described. This survey aims to construct an integrated, state-of-the-art framework for NMF concept, from which the follow-up research may benefit.

Related Papers

• → Non-Negative Matrix Factorization with Constraints(2010)60 cited
• → CUR+NMF for learning spectral features from large data matrix(2008)10 cited
• → Sparsity promoted non-negative matrix factorization for source separation and detection(2014)3 cited
• → Detection of Brain Activity in Functional Magnetic Resonance Imaging Data using Matrix Factorization(2013)1 cited
• → PHASL-NMF: Hierarchical ALS Based Power Non-Negative Matrix Factorization(2023)