High-Rank Matrix Completion and Subspace Clustering with Missing Data

Details High-Rank Matrix Completion and Subspace Clustering with Missing Data High-Rank Matrix Completion and Subspace Clustering with Missing Data

2011-12-23

arxiv.org/abs/1112.5629v2

Computer Science

Information Theory

Scientific paper

This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspaces. This generalizes the standard low-rank matrix completion problem to situations in which the matrix rank can be quite high or even full rank. Since the columns belong to a union of subspaces, this problem may also be viewed as a missing-data version of the subspace clustering problem. Let X be an n x N matrix whose (complete) columns lie in a union of at most k subspaces, each of rank <= r < n, and assume N >> kn. The main result of the paper shows that under mild assumptions each column of X can be perfectly recovered with high probability from an incomplete version so long as at least CrNlog^2(n) entries of X are observed uniformly at random, with C>1 a constant depending on the usual incoherence conditions, the geometrical arrangement of subspaces, and the distribution of columns over the subspaces. The result is illustrated with numerical experiments and an application to Internet distance matrix completion and topology identification.

Affiliated with

Also associated with

No associations

Rating

High-Rank Matrix Completion and Subspace Clustering with Missing Data does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with High-Rank Matrix Completion and Subspace Clustering with Missing Data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High-Rank Matrix Completion and Subspace Clustering with Missing Data will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-193043