Laddar...
Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares
The matrix-completion problem has attracted a lot of attention, largely as a result of the celebrated Netflix competition. Two popular approaches for solving the problem are nuclear-norm-regularized matrix approximation (Candès and Tao, 2009; Mazumder et al., 2010), and maximum-margin matrix factori...
Sparad:
| I publikationen: | J Mach Learn Res |
|---|---|
| Huvudupphovsmän: | , , , |
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Publicerad: |
2015
|
| Ämnen: | |
| Länkar: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6530939/ https://ncbi.nlm.nih.gov/pubmed/31130828 |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|