On the Complexity of Nonnegative Matrix Factorization (Q3586139): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2124172487 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56533359 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 0708.4149 / rank | |||
Normal rank | |||
Latest revision as of 17:42, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Nonnegative Matrix Factorization |
scientific article |
Statements
On the Complexity of Nonnegative Matrix Factorization (English)
0 references
6 September 2010
0 references
complexity
0 references
nonnegative matrix factorization
0 references
NP hard
0 references
nonnegative rank
0 references
data mining
0 references
database analysis, information retrieval
0 references
local search heuristic
0 references
linear programming
0 references
