Smoothed rank approximation algorithms for matrix completion.
Mohammed Al-QizwiniHayder RadhaPublished in: ACSSC (2014)
Keyphrases
- approximation algorithms
- matrix completion
- singular values
- rank aggregation
- low rank
- special case
- np hard
- vertex cover
- singular value decomposition
- worst case
- minimum cost
- collaborative filtering
- primal dual
- missing data
- constant factor
- stochastic gradient descent
- convex optimization
- incomplete data
- ranked list
- matrix factorization
- linear combination
- computational complexity
- constant factor approximation
- pairwise comparison
- undirected graph
- missing values
- pairwise
- feature space