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 the normal view instead:
scientific article; zbMATH DE number 7487116
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8210583925247192
0 references
0.7234476208686829
0 references
0.7159123420715332
0 references
0.7118960022926331
0 references
0.7092752456665039
0 references
