Deterministic algorithms for matrix completion

ABSTRACT The goal of the matrix completion problem is to retrieve an unknown real matrix from a small subset of its entries. This problem comes up in many application areas, and has received a great deal of attention in the context of the Netflix challenge. This setup usually represents our partial...

Full description

Bibliographic Details

Published in:	Random structures & algorithms Vol. 45; no. 2; pp. 306 - 317
Main Authors:	Heiman, Eyal, Schechtman, Gideon, Shraibman, Adi
Format:	Journal Article
Language:	English
Published:	Hoboken Blackwell Publishing Ltd 01.09.2014 Wiley Subscription Services, Inc
Subjects:	Algorithms Complexity deterministic guarantees Errors expander graphs factorization norms graph sparsifiers matrix completion Norms Sheds
ISSN:	1042-9832, 1098-2418
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!