Learning spectral embedding via iterative eigenvalue thresholding

ACM International Conference Proceeding Series

Volumn , Issue , 2012, Pages 1507-1511

  Shang, Fanhua ^a   Jiao, L C ^a   Liu, Yuanyuan ^a   Wang, Fei ^b  

^a XIDIAN UNIVERSITY   (China)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

fixed point method; learning spectral embedding; matrix completion; nuclear norm minimization

Indexed keywords

AUXILIARY INFORMATION; DATA REPRESENTATIONS; DATA SPACE; EIGEN-VALUE; EMBEDDING OF GRAPHS; FIXED POINT METHODS; GEOMETRICAL STRUCTURE; KERNEL MATRICES; LEARNING DATA; LEARNING SPECTRAL EMBEDDING; MATRIX COMPLETION; PAIRWISE CONSTRAINTS; POSITIVE SEMIDEFINITE MATRICES; REAL WORLD DATA; SEMI-SUPERVISED CLUSTERING; THRESHOLDING;

CLUSTERING ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; KNOWLEDGE MANAGEMENT; MATRIX ALGEBRA; VIRTUAL REALITY;

ITERATIVE METHODS;

EID: 84871046427     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2396761.2398462     Document Type: Conference Paper

References (18)

1. Z. Li, J. Liu, X. Tang. Constrained Clustering via Spectral Regularization. In CVPR, pages 421-428, 2009.
2. X.-M. Wu, A. So, Z. Li and S. Li. Fast graph Laplacian regularized kernel learning via semidefinite-quadratic-linear programming. In NIPS, pages 1964-1972, 2009.
3. F. Shang, Y. Liu, F. Wang. Learning spectral embedding for semi-supervised clustering. In ICDM, pages 597-606, 2011.
4. K. Wagstaff, C. Cardie. Clustering with instance-level constraints. In ICML, pages 1103-1110, 2000.
5. X. Wang, I. Davidson. Flexible constrained spectral clustering. In KDD, pages 563-572, 2010.
6. J. Shi, J. Malik. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell., 22(8): 888-905, 2000.
7. J. Cai, E. J. Candès, Z. Shen. A singular value thresholding algorithm for matrix completion. SIAM J. Optim., 20(4): 1956-1982, 2005.
8. S. Ma, D. Goldfarb, L. Chen. Fixed point and Bregman iterative methods for matrix rank minimization. Math. Program., 128(1-2): 321-353, 2011.
9. E. J. Candès, B. Recht. Exact matrix completion via convex optimization. Found. Comput. Math., 9(6): 717-772, 2009.
10. R. Keshavan, A. Montanari, S. Oh. Matrix completion from a few entries. IEEE Trans. Inform. Theory, 56(6): 2980-2998, 2010.
11. E. J. Candès, T. Tao. The power of convex relaxation: nearoptimal matrix completion. IEEE Trans. Inform. Theory, 56(5): 2053-2080, 2010.
12. Y. Ni, J. Sun, X. Yuan, S. Yan, L. Cheong. Robust low-rank subspace segmentation with semidefinite guarantees. In ICDM, pages 1179-1188, 2010.
13. J. Barzilai, J. Borwein. Two-point step size gradient methods. IMA J. Numer. Anal., 8: 141-148, 1988.
14. B. Borchers. CSDP, a C library for semidefinite programming. Optim. Meth. Softw., 11 (1):613-623, 1999.
15. R. H. Tütüncü, K. C. Toh, and M. J. Todd. Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program., 95: 189-217, 2003.
16. S. Kamvar, D. Klein, C. Manning. Spectral learning. In IJCAI, pages 561-566, 2003.
17. Z. Lu, M. Á. Carreira-Perpiñán. Constrained spectral clustering through affinity propagation. In CVPR, pages 848-855, 2008.
18. B. Kulis, S. Basu, I. Dhillon, R. Mooney. Semi-supervised graph clustering: A kernel approach. Mach. Learn., 74(1): 1-22, 2009.