Sparse Subspace Clustering via Group Sparse Coding
MetadataShow full item record
We propose in this paper a novel sparse subspace clustering method that regularizes sparse subspace representation by exploiting the structural sharing between tasks and data points via group sparse coding. We derive simple, provably convergent, and computationally efificient algorithms for solving the proposed group formulations. We demonstrate the advantage of the framework on three challenging benchmark datasets ranging from medical record data to image and text clustering and show that they consistently outperform rival methods.
NOTICE: This is the author’s version of a work in which changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication.
Copyright © 2013 Society for Industrial and Applied Mathematics
Showing items related by title, author, creator and subject.
Pham, DucSon; Arandjelovic, O.; Venkatesh, S. (2016)We propose an effective subspace selection scheme as a post-processing step to improve results obtained by sparse subspace clustering (SSC). Our method starts by the computation of stable subspaces using a novel random ...
Li, Q.; Liu, Wan-Quan; Li, Ling (2018)Subspace clustering refers to the problem of finding low-dimensional subspaces (clusters) for high-dimensional data. Current state-of-the-art subspace clustering methods are usually based on spectral clustering, where an ...
Zhang, X.; Pham, DucSon; Phung, D.; Liu, Wan-Quan; Saha, B.; Venkatesh, S. (2015)Many vision problems deal with high-dimensional data, such as motion segmentation and face clustering. However, these high-dimensional data usually lie in a low-dimensional structure. Sparse representation is a powerful ...