Introduction to Nonnegative Matrix Factorization
arXiv:1703.00663
Abstract
In this paper, we introduce and provide a short overview of nonnegative matrix factorization (NMF). Several aspects of NMF are discussed, namely, the application in hyperspectral imaging, geometry and uniqueness of NMF solutions, complexity, algorithms, and its link with extended formulations of polyhedra. In order to put NMF into perspective, the more general problem class of constrained low-rank matrix approximation problems is first briefly introduced.
arXiv comment18 pages, 4 figures
References in corpus (24)
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Generalized power method for sparse principal component analysis
- Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization
- Global Optimality of Local Search for Low Rank Matrix Recovery
- Matrix Completion has No Spurious Local Minimum
- A convex model for non-negative matrix factorization and dimensionality reduction on physical space
- Low-Rank Matrix Approximation with Weights or Missing Data is NP-hard
- Non-convex Robust PCA
- Sparse and Unique Nonnegative Matrix Factorization Through Data Preprocessing
- Matrix Completion from a Few Entries
- Successive Nonnegative Projection Algorithm for Robust Nonnegative Blind Source Separation
- The Non-convex Geometry of Low-rank Matrix Optimization
- Extended formulations for polygons
- Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization
- On the Geometric Interpretation of the Nonnegative Rank
- Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization
- Heuristics for Exact Nonnegative Matrix Factorization
- A Fast Gradient Method for Nonnegative Sparse Regression with Self Dictionary
- Input Sparsity and Hardness for Robust Subspace Approximation
- Lower bounds on nonnegative rank via nonnegative nuclear norms
- Low Rank Approximation with Entrywise -Norm Error
- Robustness Analysis of Preconditioned Successive Projection Algorithm for General Form of Separable NMF Problem
- Nonnegative rank depends on the field II
- Near-separable Non-negative Matrix Factorization with - and Bregman Loss Functions
Cited by in corpus (9)
- Deep matrix factorizations
- Randomized Nonnegative Matrix Factorization
- Accelerating Nonnegative Matrix Factorization Algorithms using Extrapolation
- HePPCAT: Probabilistic PCA for Data with Heteroscedastic Noise
- Relax-and-split method for nonsmooth nonconvex problems
- Bayesian Allocation Model: Inference by Sequential Monte Carlo for Nonnegative Tensor Factorizations and Topic Models using Polya Urns
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- Time series forecasting from partial observations via Non-negative Matrix Factorization
- On the Linear Extension Complexity of Stable Set Polytopes for Perfect Graphs