Subspace Clustering is a specialized form of clustering that is designed to handle high-dimensional data where clusters may exist only in specific subspaces. In subspace clustering, the algorithm aims to identify clusters that may not be apparent in the entire feature space but are present in lower-dimensional subspaces.

Posts

Scalable Deep k-Subspace Clustering

/in /by

Subspace clustering algorithms are notorious for their scalability issues because building and processing large affinity matrices are demanding. In this paper, we introduce a method that simultaneously learns an embedding space along subspaces within it to minimize a notion of reconstruction error, thus addressing the problem of subspace clustering in an end-to-end learning paradigm. To achieve our goal, we propose a scheme to update subspaces within a deep neural network. This in turn frees us from the need of having an affinity matrix to perform clustering. Unlike previous attempts, our method can easily scale up to large datasets, making it unique in the context of unsupervised learning with deep architectures. Our experiments show that our method significantly improves the clustering accuracy while enjoying cheaper memory footprints.

Read more