Nonnegative matrix factorizations and related compositional models: Equivalence, identifiability, and an application on the grain-size analysis of sediments
Not on the map. Why?
Abstract (arXiv)
Across fields such as machine learning, social science, and geology, considerable attention has been given to models that factorize a nonnegative matrix into the product of two or three matrices, subject to nonnegative or row-sum-to-1 constraints. Although these models are to a large extent similar or even equivalent, they are presented under different names, and their similarity is not well known. This paper highlights similarities among five models, latent budget analysis (LBA) and latent class analysis (LCA) from social science, end-member analysis (EMA) from geology, probabilistic latent semantic analysis (PLSA) and nonnegative matrix factorization (NMF) from machine learning. We focus on the identifiability of these models. We prove that the solution of LBA, EMA, LCA, PLSA is unique if and only if the solution of NMF is unique. Consequently, existing uniqueness theorems for NMF directly apply to LBA, EMA, LCA, PLSA, and vice versa. We also provide a brief review of algorithms for the estimation of these models. We illustrate NMF on a sedimentary grain-size distribution dataset from sedimentary geology, and end the paper with a discussion of closely related model: archetypal analysis.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 19 of its 83 references that are in the map. First posted on arXiv 25 Dec 2025.
Builds on
19 of 83 references.
References · 19
- 2018Nonnegative Matrix Factorization for Signal and Data Analytics: Identifiability, Algorithms, and Applicationscited by 55
- 2017On Identifiability of Nonnegative Matrix Factorizationcited by 34
- 2016Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clusteringcited by 28
- 2014Identifiability of the Simplex Volume Minimization Criterion for Blind Hyperspectral Unmixing: The No Pure-Pixel Casecited by 26
- 2020Simplex-Structured Matrix Factorization: Sparsity-based Identifiability and Provably Correct Algorithmscited by 21
- 2013Successive Nonnegative Projection Algorithm for Robust Nonnegative Blind Source Separationcited by 18
- 2017Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimizationcited by 18
- 2019Blind Audio Source Separation with Minimum-Volume Beta-Divergence NMFcited by 16
- 2017Non-negative Matrix Factorization via Archetypal Analysiscited by 11
- 2019Algorithms and Comparisons of Non-negative Matrix Factorization with Volume Regularization for Hyperspectral Unmixingcited by 10
- 2024Nonnegative Matrix Factorization in Dimensionality Reduction: A Surveycited by 7
- 2015Intersecting Faces: Non-negative Matrix Factorization With New Guaranteescited by 4
7 more
- 2019Near-Convex Archetypal Analysiscited by 4
- 2024Dual Simplex Volume Maximization for Simplex-Structured Matrix Factorizationcited by 4
- 2022Partial Identifiability for Nonnegative Matrix Factorizationcited by 3
- 2024On the Robustness of the Successive Projection Algorithmcited by 3
- 2021Sparse NMF with Archetypal Regularization: Computational and Robustness Propertiescited by 2
- 2021A comparison of latent semantic analysis and correspondence analysis of document-term matricescited by 2
- 2024Sum-of-norms regularized Nonnegative Matrix Factorizationcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.