High-Rank Matrix Completion and Clustering under Self-Expressive Models

Existing algorithms that deal with missing entries in high-dimensional data can be divided into two main categories.