Partial Identifiability for Nonnegative Matrix Factorization
From MaRDI portal
Publication:5885801
DOI10.1137/22M1507553MaRDI QIDQ5885801
Nicolas Gillis, Unnamed Author
Publication date: 30 March 2023
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.08022
uniqueness; identifiability; nonnegative matrix factorization; multivariate curve resolution; self-modeling curve resolution; window factor analysis
15A23: Factorization of matrices
Uses Software
Cites Work
- Analytical enclosure of the set of solutions of the three-species multivariate curve resolution problem
- On the Complexity of Nonnegative Matrix Factorization
- On the Set of Solutions of the Nonnegative Matrix Factorization Problem
- Non-Negative Matrix Factorization Revisited: Uniqueness and Algorithm for Symmetric Decomposition
- Multiplicative Updates for NMF with $\beta$-Divergences under Disjoint Equality Constraints
- Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms
- Chemometrics with R
- Uniqueness of Nonnegative Matrix Factorizations by Rigidity Theory
- A Sampling Algorithm to Compute the Set of Feasible Solutions for NonNegative Matrix Factorization with an Arbitrary Rank