Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating \(l_1\)-norm minimization (Q490274)
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: Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating lโ-norm minimization |
scientific article; zbMATH DE number 6389225
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating \(l_1\)-norm minimization |
scientific article; zbMATH DE number 6389225 |
Statements
Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating \(l_1\)-norm minimization (English)
0 references
22 January 2015
0 references
nonnegative matrix factorization
0 references
wavelet transform
0 references
Bregman iteration
0 references
sparseness
0 references
0.9048168
0 references
0.8968636
0 references
0.8891735
0 references
0.88853383
0 references
0.8832401
0 references
0.8778926
0 references
0.87558824
0 references
