Partial Identifiability for Nonnegative Matrix Factorization
From MaRDI portal
Recommendations
Cites work
- A sampling algorithm to compute the set of feasible solutions for nonnegative matrix factorization with an arbitrary rank
- Analytical enclosure of the set of solutions of the three-species multivariate curve resolution problem
- Chemometrics with R. Multivariate data analysis in the natural and life sciences
- Multiplicative Updates for NMF with $\beta$-Divergences under Disjoint Equality Constraints
- Non-Negative Matrix Factorization Revisited: Uniqueness and Algorithm for Symmetric Decomposition
- On the complexity of nonnegative matrix factorization
- On the set of solutions of the nonnegative matrix factorization problem
- Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms
- Uniqueness of Nonnegative Matrix Factorizations by Rigidity Theory
Cited in
(4)- Non-negative matrix factorization under equality constraints -- a study of industrial source identification
- Nonnegative matrix factorization via archetypal analysis
- Nonidentifiability in the presence of factorization for truncated data
- Applying non-negative matrix factorization with covariates to multivariate time series data as a vector autoregression model
This page was built for publication: Partial Identifiability for Nonnegative Matrix Factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5885801)