Deep Sparse Subspace Clustering

Abstract

In this paper, we present a deep extension of Sparse Subspace Clustering, termed Deep Sparse Subspace Clustering (DSSC). Regularized by the unit sphere distribution assumption for the learned deep features, DSSC can infer a new data affinity matrix by simultaneously satisfying the sparsity principle of SSC and the nonlinearity given by neural networks. One of the appealing advantages brought by DSSC is: when original real-world data do not meet the class-specific linear subspace distribution assumption, DSSC can employ neural networks to make the assumption valid with its hierarchical nonlinear transformations. To the best of our knowledge, this is among the first deep learning based subspace clustering methods. Extensive experiments are conducted on four real-world datasets to show the proposed DSSC is significantly superior to 12 existing methods for subspace clustering.

The initial version is completed at the beginning of 2015

References in corpus (6)

• Robust Recovery of Subspace Structures by Low-Rank Representation
• Constructing the L2-Graph for Robust Subspace Learning and Subspace Clustering
• Joint Unsupervised Learning of Deep Representations and Image Clusters
• Fixed-Rank Representation for Unsupervised Visual Learning
• A New Approach To Two-View Motion Segmentation Using Global Dimension Minimization
• Deep Subspace Clustering Networks

Cited by in corpus (8)

• Machine Learning for Intrusion Detection in Industrial Control Systems: Applications, Challenges, and Recommendations
• Learning Diverse and Discriminative Representations via the Principle of Maximal Coding Rate Reduction
• ReduNet: A White-box Deep Network from the Principle of Maximizing Rate Reduction
• Deep Unsupervised Clustering Using Mixture of Autoencoders
• A Critique of Self-Expressive Deep Subspace Clustering
• Self-Supervised Convolutional Subspace Clustering Network
• Learning a Self-Expressive Network for Subspace Clustering
• Scalable Deep $k$-Subspace Clustering