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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Random structures & algorithms Jg. 45; H. 2; S. 306 - 317
Hauptverfasser:	Heiman, Eyal, Schechtman, Gideon, Shraibman, Adi
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Hoboken Blackwell Publishing Ltd 01.09.2014 Wiley Subscription Services, Inc
Schlagworte:	Algorithms Complexity deterministic guarantees Errors expander graphs factorization norms graph sparsifiers matrix completion Norms Sheds
ISSN:	1042-9832, 1098-2418
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!