articleProceedings of the IEEEApr 30, 2010GREEN OA

Matrix Completion With Noise

California Institute of Technology

Indexed incrossref

Abstract

On the heels of compressed sensing, a new field has very recently emerged. This field addresses a broad range of problems of significant practical interest, namely, the recovery of a data matrix from what appears to be incomplete, and perhaps even corrupted, information. In its simplest form, the problem is to recover a matrix from a small sample of its entries. It comes up in many areas of science and engineering, including collaborative filtering, machine learning, control, remote sensing, and computer vision, to name a few. This paper surveys the novel literature on matrix completion, which shows that under some suitable conditions, one can recover an unknown low-rank matrix from a nearly minimal set of…

Citation impact

1,735
total citations
FWCI
95.65
Percentile
100%
References
34
Citations per year

Authors

2

Topics & keywords

Keywords
  • Matrix completion
  • Matrix (chemical analysis)
  • Computer science
  • Low-rank approximation
  • Rank (graph theory)
  • Matrix norm
  • Algorithm
  • Noise (video)
No related works found for this paper.