Sparse subspace clustering via group sparse coding

Proceedings of the 2013 SIAM International Conference on Data Mining, SDM 2013

Volumn , Issue , 2013, Pages 130-138

  Saha, Budhaditya ^b   Son Pham, Duc ^a   Phung, Dinh ^b   Venkatesh, Svetha ^b  

^a CURTIN UNIVERSITY   (Australia)

^b DEAKIN UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; CLUSTERING ALGORITHMS; CODES (SYMBOLS); MEDICAL IMAGING; ALGORITHMS;

BENCHMARK DATASETS; COMPUTATIONALLY EFFICIENT; DATA POINTS; GROUP SPARSE; MEDICAL RECORD; SUB-SPACE CLUSTERING; SUBSPACE REPRESENTATION; TEXT CLUSTERING;

DATA MINING;

EID: 84929176622     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972832.15     Document Type: Conference Paper

References (32)

1. R.G. Baraniuk, V. Cevher, M.F. Duarte, and C. Hegde. Model-based compressive sensing. IEEE Trans. Info. Theory, 56(4):1982-2001, 2010.
2. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein. Foundations and Trends in Machine Learning, volume 3, chapter Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers, pages 1- 122. 2011.
3. E.J. Candes, X. Li, Y. Ma, and J. Wright. Robust principal component analysis? Journal of the ACM, 58(3), 2011.
4. E.J. Candès and B. Recht. Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6):717-772, 2009.
5. E.J. Candès, J. Romberg, and T. Tao. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE TIP, 52(2):489-509, 2006.
6. J.P. Costeira and T. Kanade. A multibody factorization method for independently moving objects. IJCV, 29(3):159-179, 1998.
7. D.L. Donoho. Compressed sensing. IEEE Trans. Info. Theory, 52(4):1289-1306, 2006.
8. Y.C. Eldar and M. Mishali. Robust recovery of signals from a structured union of subspaces. IEEE Trans. Info. Theory, 55(11):5302-5316, 2009.
9. E. Elhamifar and R. Vidal. Sparse subspace clustering. In Proc. CVPR, pages 2790-2797, 2009.
10. M.A. Fischler and R.C. Bolles. Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Communications of the ACM, 24(6):381-395, 1981.
11. B.J. Frey and D. Dueck. Clustering by passing messages between data points. science, 315(5814):972-976, 2007.
12. A. Gruber and Y. Weiss. Multibody factorization with uncertainty and missing data using the EM algorithm. In Proc. CVPR, 2004.
13. S Gupta, D Phung, and S Venkatesh. A bayesian nonparametric joint factor model for learning shared and individual subspaces from multiple data sources. In Proc. SDM, pages 200-211, 2012.
14. X. He, D. Cai, H. Liu, and W.Y. Ma. Locality preserving indexing for document representation. In Proc. ACM SIGIR, pages 96-103, 2004.
15. J. Ho, M.H. Yang, J. Lim, K.C. Lee, and D. Kriegman. Clustering appearances of objects under varying illumination conditions. In Proc. CVPR, 2003.
16. W. Hong, J. Wright, K. Huang, and Y. Ma. A multiscale hybrid linear model for lossy image representation. In Proc. ICCV, pages 764-771, 2005.
17. J. Huang and T. Zhang. The benefit of group sparsity. The Annals of Statistics, 38(4):1978-2004, 2010.
18. J Ye Jun Liu, S Ji. Mining sparse representations: Formulations, algorithms and applications. Tutorial in SDM, 2010.
19. K. Kanatani. Motion segmentation by subspace separation and model selection. In Proc. ICCV, volume 2, pages 586-591, 2001.
20. T. Kanungo, D.M. Mount, N.S. Netanyahu, C.D. Piatko, R. Silverman, and A.Y. Wu. An efficient k-means clustering algorithm: Analysis and implementation. IEEE PAMI, 24(7):881-892, 2002.
21. G. Liu, Z. Lin, and Y. Yu. Robust subspace segmentation by low-rank representation. In Proc. ICML, 2010.
22. Y.M. Lu and M.N. Do. A theory for sampling signals from a union of subspaces. IEEE Trans. Sig. Process., 56(6):2334-2345, 2008.
23. B. Nasihatkon and R. Hartley. Graph connectivity in sparse subspace clustering. In Proc. CVPR, 2011.
24. Duc-Son Pham, B Saha, dinh Phung, and Svetha Venkatesh. Improved subspace clustering via exploitation of spatial constraints. In Proc. CVPR. IEEE, 2012.
25. S.R. Rao, R. Tron, R. Vidal, and Y. Ma. Motion segmentation via robust subspace separation in the presence of outlying, incomplete, or corrupted trajectories. IEEE PAMI, pages 1832-1845, 2009.
26. S.R. Rao, A.Y. Yang, S.S. Sastry, and Y. Ma. Robust algebraic segmentation of mixed rigid-body and planar motions from two views. IJCV, 88(3):425-446, 2010.
27. M.E. Tipping and C.M. Bishop. Mixtures of probabilistic principal component analyzers. Neural computation, 11(2):443-482, 1999.
28. R. Vidal, Y. Ma, and S. Sastry. Generalized principal component analysis (gpca). IEEE PAMI, 27(12):1945-1959, 2005.
29. R. Vidal, R. Tron, and R. Hartley. Multiframe motion segmentation with missing data using power factorization and GPCA. IJCV, 79(1):85-105, 2008.
30. J. Vogt and V. Roth. A complete analysis of the l 1, p grouplasso. arXiv preprint arXiv:1206.4632, 2012.
31. A.Y. Yang, J. Wright, Y. Ma, and S.S. Sastry. Unsupervised segmentation of natural images via lossy data compression. In proc. CVIU, 110(2):212-225, 2008.
32. H. Zou and T. Hastie. Regression shrinkage and selection via the elastic net, with applications to microarrays. Journal of the Royal Statistical Society: Series B. v67, pages 301-320, 2003.