On the Complexity of Nonnegative Matrix Factorization (Q3586139): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q56533359, #quickstatements; #temporary_batch_1711574657256 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56533359 / rank | |||
Normal rank | |||
Revision as of 01:36, 28 March 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
