Načítá se...
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...
Uloženo v:
| Vydáno v: | J Mach Learn Res |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
2015
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6530939/ https://ncbi.nlm.nih.gov/pubmed/31130828 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|