Fast and accurate matrix completion via truncated nuclear norm regularization
Recovering a large matrix from a small subset of its entries is a challenging problem arising in many real applications, such as image inpainting and recommender systems. Many existing approaches formulate this problem as a general low-rank matrix approximation problem. Since the rank operator is no...
Description complète
Détails bibliographiques
| Publié dans: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 35(2013), 9 vom: 20. Sept., Seite 2117-30
|
|---|
| Auteur principal: |
Hu, Yao
(Auteur) |
|---|
| Autres auteurs: |
Zhang, Debing,
Ye, Jieping,
Li, Xuelong,
He, Xiaofei |
|---|
| Format: | Article en ligne
|
|---|
| Langue: | English |
|---|
| Publié: |
2013
|
|---|
| Accès à la collection: | IEEE transactions on pattern analysis and machine intelligence
|
|---|
| Sujets: | Journal Article
Research Support, Non-U.S. Gov't
Research Support, U.S. Gov't, Non-P.H.S. |
|---|