Generalized Separable Nonnegative Matrix Factorization

Abstract

Nonnegative matrix factorization (NMF) is a linear dimensionality technique for nonnegative data with applications such as image analysis, text mining, audio source separation and hyperspectral unmixing. Given a data matrix $M$ and a factorization rank $r$, NMF looks for a nonnegative matrix $W$ with $r$ columns and a nonnegative matrix $H$ with $r$ rows such that $M\approx WH$. NMF is NP-hard to solve in general. However, it can be computed efficiently under the separability assumption which requires that the basis vectors appear as data points, that is, that there exists an index set $\mathcal{K}$ such that $W=M(:,\mathcal{K})$. In this paper, we generalize the separability assumption: We only require that for each rank-one factor $W(:,k)H(k,:)$ for $k=1,2,\dots ,r$, either $W(:,k)=M(:,j)$ for some $j$ or $H(k,:)=M(i,:)$ for some $i$. We refer to the corresponding problem as generalized separable NMF (GS-NMF). We discuss some properties of GS-NMF and propose a convex optimization model which we solve using a fast gradient method. We also propose a heuristic algorithm inspired by the successive projection algorithm. To verify the effectiveness of our methods, we compare them with several state-of-the-art separable NMF algorithms on synthetic, document and image data sets.

31 pages, 12 figures, 4 tables. We have added discussions about the identifiability of the model, we have modified the first synthetic experiment, we have clarified some aspects of the contribution

References in corpus (18)

• Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization
• The Why and How of Nonnegative Matrix Factorization
• Nonnegative Matrix Factorization for Signal and Data Analytics: Identifiability, Algorithms, and Applications
• Accelerated Multiplicative Updates and Hierarchical ALS Algorithms for Nonnegative Matrix Factorization
• A convex model for non-negative matrix factorization and dimensionality reduction on physical space
• A Practical Algorithm for Topic Modeling with Provable Guarantees
• Fast Conical Hull Algorithms for Near-separable Non-negative Matrix Factorization
• Identifiability of the Simplex Volume Minimization Criterion for Blind Hyperspectral Unmixing: The No Pure-Pixel Case
• Factoring nonnegative matrices with linear programs
• Hierarchical Clustering of Hyperspectral Images using Rank-Two Nonnegative Matrix Factorization
• Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering
• Successive Nonnegative Projection Algorithm for Robust Nonnegative Blind Source Separation
• On Identifiability of Nonnegative Matrix Factorization
• Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization
• Rectangular maximum-volume submatrices and their applications
• Robustness Analysis of Hottopixx, a Linear Programming Model for Factoring Nonnegative Matrices
• A Fast Gradient Method for Nonnegative Sparse Regression with Self Dictionary
• Successive normalization of rectangular arrays

Cited by in corpus (3)

• Tangent Space Based Alternating Projections for Nonnegative Low Rank Matrix Approximation
• Dual-constrained Deep Semi-Supervised Coupled Factorization Network with Enriched Prior
• Nonnegative Low Rank Tensor Approximation and its Application to Multi-dimensional Images