Semi-supervised learning with mixed knowledge information

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2012, Pages 732-740

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

^a XIDIAN UNIVERSITY   (China)

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

Author keywords

graph laplacian; kernel learning; nuclear norm regularization; pairwise constraints; semi supervised learning (ssl)

Indexed keywords

GRAPH LAPLACIAN; KERNEL LEARNING; NUCLEAR NORM REGULARIZATION; PAIRWISE CONSTRAINTS; SEMI-SUPERVISED LEARNING;

DATA MINING; EIGENVALUES AND EIGENFUNCTIONS; LAPLACE TRANSFORMS;

SUPERVISED LEARNING;

EID: 84866046924     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339646     Document Type: Conference Paper

References (43)

1. O. Chapelle, B. Schölkopf, A. Zien. Semi-Supervised Learning. The MIT Press, Cambridge, MA, 2006.
2. X. Zhu. Semi-supervised learning literature survey. Tech. rep., Computer Sciences, University of Wisconsin-Madison, 2008.
3. X. Zhu, Z. Ghahramani, J. Lafferty. Semi-supervised learning using Gaussian fields and harmonic functions. In ICML, pages 912-919, 2003.
4. D. Zhou, O. Bousquet, T. Lal, J. Weston, B. Schölkopf. Learning with local and global consistency. In NIPS, pages 321-328, 2004.
5. M. Belkin, P. Niyogi, V. Sindhwani. Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. J. Mach. Learn. Res., 7:2399-2434, 2006.
6. S. Melacci, M. Belkin. Laplacian support vector machines trained in the primal. J. Mach. Learn. Res., 12:1149-1184, 2011.
7. Z. Li, J. Liu, X. Tang. Pairwise constraint propagation by semidefinite programming for semi-supervised classification. In ICML, pages 576-583, 2008.
8. R. Yan, J. Zhang, J. Yang, A. Hauptmann. A discriminative learning framework with pairwise constraints for video object classification. IEEE Trans. Pattern Anal. Mach. Intell., 28(4):578-593, 2006.
9. K. Wagstaff, C. Cardie. Clustering with instance-level constraints. In ICML, pages 1103-1110, 2000.
10. D. Klein, S. Kamvar, C. Manning. From instance-level constraints to space-level constraints: making the most of prior knowledge in data clustering. In ICML, pages 307-314, 2002.
11. S. Basu, M. Bilenko, R. Mooney. A probabilistic framework for semi-supervised clustering. In KDD, pages 59-68, 2004.
12. B. Kulis, S. Basu, I. Dhillon, R. Mooney. Semi-supervised graph clustering: A kernel approach. In ICML, pages 457-464, 2005.
13. E. Xing, A. Ng, M. Jordan, S. Russell. Distance metric learning, with application to clustering with side-information. In NIPS, pages 505-512, 2003.
14. M. Bilenko, S. Basu, R. Mooney. Integrating constraints and metric learning in semi-supervised clustering. In ICML, pages 81-88, 2004.
15. J. Davis, B. Kulis, P. Jain, S. Sra, I. S. Dhillon. Information theoretic metric learning. In ICML, pages 209-216, 2007.
16. T. Joachims. Transductive inference for text classification using support vector machines. In ICML, pages 200-209, 1999.
17. O. Chapelle, A. Zien. Semi-supervised classification by low density separation. In AISTATS, pages 57-64, 2005.
18. J. Zhuang, I. Tsang, S.C.H. Hoi. A family of simple non-parametric kernel learning algorithms. J. Mach. Learn. Res., 12:1313-1347, 2011.
19. X. Zhu, J. S. Kandola, Z. Ghahramani, J. D. Lafferty. Nonparametric transforms of graph kernels for semi-supervised learning. In NIPS, pages 1641-1648, 2005.
20. S. Hoi, M. Lyu, E. Chang. Learning the unified kernel machines for classification. In KDD, pages 187-196, 2006.
21. S. Hoi, R. Jin, M. Lyu. Learning nonparametric kernel matrices from pairwise constraints. In ICML, pages 361-368, 2007.
22. W. Liu, B. Qian, J. Cui, J. Liu. Spectral kernel learning for semi-supervised classification. In IJCAI, pages 1150-1155, 2009.
23. E. Hu, S. Chen, D. Zhang, X. Yin. Semisupervised kernel matrix learning by kernel propagation. IEEE Trans. Neural Netw., 21(11):1831-1841, 2010.
24. X. -M. Wu, A. So, Z. Li, S. Li. Fast graph Laplacian regularized kernel learning via semidefinite-quadratic-linear programming. In NIPS, pages 1964-1972, 2009.
25. L. Zelnik-Manor, P. Perona. Self-tuning spectral clustering. In NIPS, pages 1601-1608, 2004.
26. F. Wang, C. Zhang. Label propagation through linear neighborhoods. IEEE Trans. Knowl. Data Eng., 20(1):55-67, 2008.
27. J. Cai, E. J. Candès, Z. Shen. A singular value thresholding algorithm for matrix completion. SIAM J. Optim., 20(4):1956-1982, 2010.
28. S. Ma, D. Goldfarb, L. Chen. Fixed point and Bregman iterative methods for matrix rank minimization. Math. Program., 128(1):321-353, 2011.
29. Z. Lin, M. Chen, L. Wu. The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices. Math. Program., submitted, 2009.
30. E. J. Candès, B. Recht. Exact matrix completion via convex optimization. Found. Comput. Math., 9(6):717-772, 2009.
31. K. Q. Weinberger, F. Sha, Q. Zhu, L. K. Saul. Graph Laplacian regularization for large-scale semidefinite programming. In NIPS, pages 1489-1496, 2007.
32. F. Shang, Y. Liu, F. Wang. Learning spectral embedding for semisupervised clustering. In ICDM, pages 597-606, 2011.
33. Z. Liu, L. Vandenberghe. Interior-point method for nuclear norm approximation with application to system identification. SIAM J. Matrix Anal. Appl., 31(3):1235-1256, 2010.
34. Y. Ni, J. Sun, X. Yuan, S. Yan, L. Cheong. Robust low-rank subspace segmentation with semidefinite guarantees. In ICDM, pages 1179-1188, 2010.
35. A. B. Goldberg, X. Zhu, B. Recht, J. Xu, R. Nowak. Transduction with matrix completion: three birds with one stone. In NIPS, 2010.
36. G. Watson. Characterization of the subdifferential of some matrix norms. Linear Algebra Appl., 170:33-45, 1992.
37. Y. Ma, L. Zhi. The minimum-rank gram matrix completion via modified fixed point continuation method. In ISSAC, pages 241-248, 2011.
38. J. Barzilai, J. Borwein. Two-point step size gradient methods. IMA J. Numer. Anal., 8:141-148, 1988.
39. G. H. Golub, C. F. V. Loan. Matrix computations. Third edition, Johns Hopkins University Press, 1996.
40. C. Chang, C. Lin. LIBSVM: A library for support vector machines, 2001. Available at http://www.csie.ntu.edu.tw/~cjlin/libsvm.
41. Y. LeCun, C. Cortes. The MNIST database of handwritten digits, 2009. Available: http://yann.lecun.com/exdb/mnist/.
42. S.A. Nene, S.K. Nayar, J. Murase. Columbia object image library (COIL-20). Tech. rep., CUCS-005-96, Columbia Univ., 1996.
43. A.S. Georghiades, P.N. Belhumeur, D.J. Kriegman. From few to many: illumination cone models for face recognition under variable lighting and pose. IEEE Trans. Pattern Anal. Mach. Intell., 23(6):643-660, 2001.