Data clustering by laplacian regularized l1 -graph

Proceedings of the National Conference on Artificial Intelligence

Volumn 4, Issue , 2014, Pages 3148-3149

  Yang, Yingzhen ^a   Wang, Zhangyang ^a   Yang, Jianchao ^b   Wang, Jiangping ^a   Chang, Shiyu ^a   Huang, Thomas S ^a  

^a University of Illinois at Urbana Champaign   (United States)

^b ADOBE RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA CLUSTERING; LAPLACIANS;

EID: 84908204128     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. Belkin, M.; Niyogi, P.; and Sindhwani, V. 2006. Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. Journal of Machine Learning Research 7:2399-2434.
2. Cheng, B.; Yang, J.; Yan, S.; Fu, Y.; and Huang, T. S. 2010. Learning with II-graph for image analysis. IEEE Transactions on Image Processing 19(4):858-866.
3. Elhamifar, E., and Vidal, R. 2011. Sparse manifold clustering and embedding. In NIPS, 55-63.
4. He, X.; Cai, D.; Shao, Y.; Bao, H.; and Han, J. 2011. Laplacian regularized gaussian mixture model for data clustering. Knowledge and Data Engineering, IEEE Transactions on 23(9): 1406-1418.
5. Lee, H.; Battle, A.; Raina, R.; and Ng, A. Y. 2006. Efficient sparse coding algorithms. In NIPS, 801-808.