Learning robust graph regularisation for subspace clustering

British Machine Vision Conference 2016, BMVC 2016

Volumn 2016-September, Issue , 2016, Pages 138.1-138.12

  Kodirov, Elyor ^a   Xiang, Tao ^a   Fu, Zhenyong ^a   Gong, Shaogang ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; CLUSTERING ALGORITHMS; COMPUTER VISION; OPTIMIZATION;

BENCHMARK DATASETS; GRAPH TOPOLOGY; OBJECTIVE FUNCTIONS; OPTIMISATION PROBLEMS; REGULARISATION; ROBUST GRAPHS; STATE OF THE ART; SUB-SPACE CLUSTERING;

TOPOLOGY;

EID: 85036637717     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5244/C.30.138     Document Type: Conference Paper

References (26)

1. Richard H. Bartels and GW Stewart. Solution of the matrix equation ax+ xb= c [f4]. Communications of the ACM, 15(9):820–826, 1972.
2. Stephen Boyd, Neal Parikh, Eric Chu, Borja Peleato, and Jonathan Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, 3(1):1–122, 2011.
3. Paul S Bradley and Olvi L Mangasarian. k-plane clustering. Journal of Global Optimization, 16(1):23–32, 2000.
4. Deng Cai, Xiaofei He, Jiawei Han, and Thomas S Huang. Graph regularized non-negative matrix factorization for data representation. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 33(8):1548–1560, 2011.
5. 1-graph for image analysis. IEEE Transactions on Image Processing, 19(4):858–866, 2010.
6. Fan RK Chung. Spectral graph theory, volume 92. American Mathematical Soc., 1997.
7. Samuel I Daitch, Jonathan A Kelner, and Daniel A Spielman. Fitting a graph to vector data. In Proceedings of the 26th Annual International Conference on Machine Learning, pages 201–208. ACM, 2009.
8. Xiaowen Dong, Dorina Thanou, Pascal Frossard, and Pierre Vandergheynst. Laplacian matrix learning for smooth graph signal representation. In Proceedings of IEEE ICASSP, number EPFL-CONF-205027, 2015.
9. Ehsan Elhamifar and Ren Vidal. Sparse subspace clustering. In Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on, pages 2790–2797. 2009.
10. Xiaojie Guo. Robust subspace segmentation by simultaneously learning data representations and their affinity matrix. In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), 2015.
11. Han Hu, Zhouchen Lin, Jianjiang Feng, and Jie Zhou. Smooth representation clustering. In Computer Vision and Pattern Recognition (CVPR), 2014 IEEE Conference on, pages 3834–3841. IEEE, 2014.
12. Ian Jolliffe. Principal component analysis. Wiley Online Library, 2002.
13. Daniel D Lee and H Sebastian Seung. Algorithms for non-negative matrix factorization. In NIPS, 2001.
14. Honglak Lee, Alexis Battle, Rajat Raina, and Andrew Y Ng. Efficient sparse coding algorithms. In Advances in neural information processing systems, pages 801–808, 2006.
15. Guangcan Liu, Zhouchen Lin, and Yong Yu. Robust subspace segmentation by low-rank representation. In Proceedings of the 27th international conference on machine learning (ICML-10), pages 663–670, 2010.
16. Canyi Lu, Hai Min, Zhong-Qiu Zhao, Lin Zhu, De-Shuang Huang, and Shuicheng Yan. Robust and efficient subspace segmentation via least squares regression. In Computer Vision–ECCV 2012, pages 347–360. Springer, 2012.
17. Canyi Lu, Jiashi Feng, Zhouchen Lin, and Shuicheng Yan. Correlation adaptive subspace segmentation by trace lasso. In Computer Vision (ICCV), 2013 IEEE International Conference on, pages 1345–1352. IEEE, 2013.
18. Yi Ma, Harm Derksen, Wei Hong, and John Wright. Segmentation of multivariate mixed data via lossy data coding and compression. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 29(9):1546–1562, 2007.
19. Yi Ma, Allen Y Yang, Harm Derksen, and Robert Fossum. Estimation of subspace arrangements with applications in modeling and segmenting mixed data. SIAM review, 50(3):413–458, 2008.
20. Feiping Nie, Xiaoqian Wang, and Heng Huang. Clustering and projected clustering with adaptive neighbors. In Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 977–986. ACM, 2014.
21. Jianbo Shi and Jitendra Malik. Normalized cuts and image segmentation. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 22(8):888–905, 2000.
22. Pablo Sprechmann and Guillermo Sapiro. Dictionary learning and sparse coding for unsupervised clustering. In ICASSP, 2010.
23. Ren Vidal. A tutorial on subspace clustering. IEEE Signal Processing Magazine, 28 (2):52–68, 2010.
24. Yingzhen Yang, Zhangyang Wang, Jianchao Yang, Jiawei Han, and Thomas Huang. Regularized l1-graph for data clustering. In Proceedings of the British Machine Vision Conference. BMVA Press, 2014.
25. Ming Yin, Junbin Gao, and Zhouchen Lin. Laplacian regularized low-rank representation and its applications. 2015.
26. Miao Zheng, Jiajun Bu, Chun Chen, Can Wang, Lijun Zhang, Guang Qiu, and Deng Cai. Graph regularized sparse coding for image representation. Image Processing, IEEE Transactions on, 20(5):1327–1336, 2011.