Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard.
Nicolas GillisFrançois GlineurPublished in: SIAM J. Matrix Anal. Appl. (2011)
Keyphrases
- missing data
- low rank matrix approximation
- matrix completion
- np hard
- low rank
- low rank approximation
- incomplete data
- missing values
- matrix factorization
- optimal solution
- linear combination
- lower bound
- special case
- linear programming
- rank minimization
- kernel matrix
- low rank matrix
- spectral clustering
- data matrix
- recommender systems