A Sampling Algorithm to Compute the Set of Feasible Solutions for NonNegative Matrix Factorization with an Arbitrary Rank

DOI10.1137/20M1378971OpenAlexW3121908401WikidataQ114074138 ScholiaQ114074138MaRDI QIDQ5862809

Ragnhild Laursen, Asger Hobolth

Publication date: 10 March 2022

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.07526

zbMATH Keywords

samplinguniquenessidentifiabilitynonnegative matrix factorizationmutational processes

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to statistics (62-04) Applications of statistics to biology and medical sciences; meta analysis (62P10) Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical linear algebra (65F99)

Related Items (2)

Partial Identifiability for Nonnegative Matrix Factorization ⋮ SFS

Uses Software

• R
• GitHub
• FACPACK
• signeR

Cites Work

• On the geometric interpretation of the nonnegative rank
• Sampling-Based Approaches to Calculating Marginal Densities
• 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
• A Brief Survey of Modern Optimization for Statisticians

This page was built for publication: A Sampling Algorithm to Compute the Set of Feasible Solutions for NonNegative Matrix Factorization with an Arbitrary Rank