A sampling algorithm to compute the set of feasible solutions for nonnegative matrix factorization with an arbitrary rank

DOI10.1137/20M1378971MaRDI QIDQ5862809zbMATH OpenOpenAlexWikidataFDO

Authors 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

identifiabilitymutational processesnonnegative matrix factorizationsamplinguniqueness

Mathematics Subject Classification ID

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

Recommendations

• On the set of solutions of the nonnegative matrix factorization problem
• A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data
• Independent Component Analysis and Blind Signal Separation
• Computing a nonnegative matrix factorization -- provably
• Nonnegative matrix factorization

Cites work

• A brief survey of modern optimization for statisticians
• Non-Negative Matrix Factorization Revisited: Uniqueness and Algorithm for Symmetric Decomposition
• On the complexity of nonnegative matrix factorization
• On the geometric interpretation of the nonnegative rank
• On the set of solutions of the nonnegative matrix factorization problem
• Sampling-Based Approaches to Calculating Marginal Densities

Cited in

(5)

• SFS
• On the set of solutions of the nonnegative matrix factorization problem
• Partial Identifiability for Nonnegative Matrix Factorization
• Flexible model-based non-negative matrix factorization with application to mutational signatures
• Robust machine learning algorithms for text analysis

Describes a project that uses

Uses Software

• R
• signeR
• FACPACK
• GitHub

This page was built for publication: A sampling algorithm to compute the set of feasible solutions for nonnegative matrix factorization with an arbitrary rank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5862809)