Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm.
Anders P. ErikssonAnton van den HengelPublished in: CVPR (2010)
Keyphrases
- efficient computation
- low rank matrix
- missing data
- low rank
- matrix factorization
- missing entries
- rank minimization
- missing values
- matrix completion
- low rank approximation
- computational efficiency
- incomplete data
- singular value decomposition
- linear combination
- norm minimization
- high dimensional data
- data matrix
- convex optimization
- singular values
- tensor decomposition
- data representation
- approximation methods
- database
- computationally efficient
- dimensionality reduction
- bayesian networks