Sparse Subspace Clustering via Group Sparse Coding

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 efificient algorithms for solving...

Full description

Bibliographic Details
Main Authors: Budhaditya, S., Pham, DucSon, Phung, D., Venkatesh, S.
Other Authors: Joydeep Ghosh
Format: Conference Paper
Published: SIAM 2013
Subjects:
data mining
sparsity learning
sparse subspace clustering
optimization
regularization
Online Access:http://hdl.handle.net/20.500.11937/16995

Internet

http://hdl.handle.net/20.500.11937/16995

Similar Items