Theoretical Analysis of Sparse Subspace Clustering with Missing Entries

Abstract

Sparse Subspace Clustering (SSC) is a popular unsupervised machine learning method for clustering data lying close to an unknown union of low-dimensional linear subspaces; a problem with numerous applications in pattern recognition and computer vision. Even though the behavior of SSC for complete data is by now well-understood, little is known about its theoretical properties when applied to data with missing entries. In this paper we give theoretical guarantees for SSC with incomplete data, and analytically establish that projecting the zero-filled data onto the observation pattern of the point being expressed leads to a substantial improvement in performance. The main insight that stems from our analysis is that even though the projection induces additional missing entries, this is counterbalanced by the fact that the projected and zero-filled data are in effect incomplete points associated with the union of the corresponding projected subspaces, with respect to which the point being expressed is complete. The significance of this phenomenon potentially extends to the entire class of self-expressive methods.

References in corpus (8)

• Robust Recovery of Subspace Structures by Low-Rank Representation
• A Simpler Approach to Matrix Completion
• A geometric analysis of subspace clustering with outliers
• Oracle Based Active Set Algorithm for Scalable Elastic Net Subspace Clustering
• High-Dimensional Matched Subspace Detection When Data are Missing
• Hyperplane Clustering Via Dual Principal Component Pursuit
• Subspace Clustering with Missing and Corrupted Data
• On deterministic conditions for subspace clustering under missing data