Low-rank matrix approximation with weights or missing data is NP-hard (Q3225532)
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: Low-rank matrix approximation with weights or missing data is NP-hard |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Low-rank matrix approximation with weights or missing data is NP-hard |
scientific article |
Statements
Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard (English)
0 references
21 March 2012
0 references
weighted low-rank matrix approximation
0 references
missing data
0 references
matrix completion with noise
0 references
principal component analysis
0 references
computational complexity
0 references
biadjacency matrix
0 references
bipartite graph
0 references
nonnegative matrix factorization
0 references
0.7858507037162781
0 references
0.7788000106811523
0 references
0.7511835098266602
0 references
0.7381619811058044
0 references
