A Sampling Algorithm to Compute the Set of Feasible Solutions for NonNegative Matrix Factorization with an Arbitrary Rank (Q5862809)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Sampling Algorithm to Compute the Set of Feasible Solutions for NonNegative Matrix Factorization with an Arbitrary Rank |
scientific article; zbMATH DE number 7487116
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Sampling Algorithm to Compute the Set of Feasible Solutions for NonNegative Matrix Factorization with an Arbitrary Rank |
scientific article; zbMATH DE number 7487116 |
Statements
A Sampling Algorithm to Compute the Set of Feasible Solutions for NonNegative Matrix Factorization with an Arbitrary Rank (English)
0 references
10 March 2022
0 references
identifiability
0 references
mutational processes
0 references
nonnegative matrix factorization
0 references
sampling
0 references
uniqueness
0 references
0 references
