Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard (Q3225532)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
