Sparse subspace clustering via group sparse coding
Saha, Budhaditya, Pham, Duc Son, Phung, Dinh and Venkatesh, Svetha 2013, Sparse subspace clustering via group sparse coding, in SDM 2013 : Proceedings of the thirteenth SIAM International Conference on Data Mining, Society for Industrial and Applied Mathematics, Austin, Texas, pp. 130-138.
Attached Files
Name
Description
MIMEType
Size
Downloads
Title
Sparse subspace clustering via group sparse coding
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 efficient 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 outperforms rival methods.
Language
eng
Field of Research
080109 Pattern Recognition and Data Mining
Socio Economic Objective
970108 Expanding Knowledge in the Information and Computing Sciences
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.