Pairwise constraint propagation by semidefinite programming for semi-supervised classification

Proceedings of the 25th International Conference on Machine Learning

Volumn , Issue , 2008, Pages 576-583

  Li, Zhenguo ^a   Liu, Jianzhuang ^a   Tang, Xiaoou ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); MACHINE LEARNING; MAPPING; LEARNING SYSTEMS; PROGRAMMING THEORY; ROBOT LEARNING;

CLASSIFICATION TASKS; MULTI-CLASS CLASSIFICATION; PAIRWISE CONSTRAINTS; SEMI-DEFINITE PROGRAMMING; SEMI-SUPERVISED CLASSIFICATION; SEMIDEFINITE PROGRAMMING PROBLEM; SYNTHETIC AND REAL DATA; UNIFIED FRAMEWORK;

SUPERVISED LEARNING; DEMODULATION;

CLASSIFICATION TASKS; DATA GRAPHS; DATA LABELS; DATA SETS; MULTI-CLASS CLASSIFICATIONS; PAIR-WISE CONSTRAINTS; SEMI-DEFINITE PROGRAMMING; SEMI-SUPERVISED CLASSIFICATIONS; SEMIDEFINITE PROGRAMMING PROBLEMS; SYNTHETIC AND REAL DATUM; UNIFIED FRAMEWORKS; UNLABELED DATUM;

EID: 56449130871     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1390156.1390229     Document Type: Conference Paper

References (30)

1. Bar-Hillel, A., Hertz, T., Shental, N., & Weinshall, D. (2003). Learning distance functions using equivalence relations. ICML (pp. 11-18).
2. Basu, S., Bilenko, M., & Mooney, R. (2004). A probabilistic framework for semi-supervised clustering. SIGKDD (pp. 59-68).
3. Belkin, M., Niyogi, P., & Sindhwani, V. (2006). Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. Journal of Machine Learning Research, 7, 2399-2434.
4. Bilenko, M., Basu, S., & Mooney, R. (2004). Integrating constraints and metric learning in semi-supervised clustering. ICML.
5. Borchers, B. (1999). CSDP, a C library for semidefinite programming. Optimization Methods & Software, 11-2, 613-623.
6. Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge University Press.
7. Chapelle, O., Schölkopf, B., & Zien, A. (2006). Semi-supervised learning. MIT Press.
8. Chapelle, O., & Zien, A. (2005). Semi-supervised classification by low density separation. AISTATS.
9. Chung, F. (1997). Spectral graph theory. American Mathematical Society.
10. Globerson, A., & Roweis, S. (2006). Metric learning by collapsing classes. Advances in Neural Information Processing Systems (pp. 451-458).
11. Goldberg, A., Zhu, X., & Wright, S. (2007). Dissimilarity in graph-based semisupervised classification. AISTATS.
12. Hoi, S., Jin, R., & Lyu, M. (2007). Learning nonparametric kernel matrices from pairwise constraints. ICML (pp. 361-368).
13. Kamvar, S., Klein, D., & Manning, C. (2003). Spectral learning. IJCAI (pp. 561-566).
14. Klein, D., Kamvar, S., & Manning, C. (2002). From instance-level constraints to space-level constraints: Making the most of prior knowledge in data clustering. ICML (pp. 307-314).
15. Kulis, B., Basu, S., Dhillon, I., & Mooney, R. (2005). Semi-supervised graph clustering: A kernel approach. ICML (pp. 457-464).
16. Li, Z., Liu, J., Chen, S., & Tang, X. (2007). Noise robust spectral clustering. ICCV.
17. Schölkopf, B., & Smola, A. (2002). Learning with kernels: support vector machines, regularization, optimization, and beyond. MIT Press.
18. Shawe-Taylor, J., & Cristianini, N. (2004). Kernel methods for pattern analysis. Cambridge University Press.
19. Smola, A., & Kondor, R. (2003). Kernels and regularization on graphs. COLT.
20. Strehl, A., & Ghosh, J. (2003). Cluster ensembles - a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research, 3, 583-617.
21. Sturm, J. F. (1999). Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optimization Methods & Software, 11-2, 625-653.
22. Szummer, M., Jaakkola, T., & Cambridge, M. (2002). Partially labeled classification with markov random walks. Advances in Neural Information Processing Systems.
23. Tong, W., & Jin, R. (2007). Semi-supervised learning by mixed label propagation. AAAI.
24. Wagstaff, K., & Cardie, C. (2000). Clustering with instance-level constraints. ICML (pp. 1103-1110).
25. Wagstaff, K., Cardie, C., Rogers, S., & Schroedl, S. (2001). Constrained k-nieans clustering with background knowledge. ICML (pp. 577-584).
26. Xing, E., Ng, A., Jordan, M., & Russell, S. (2003). Distance metric learning, with application to clustering with side-information. Advances in Neural Information Processing Systems (pp. 505-512).
27. Zhang, T., & Ando, R. (2006). Analysis of spectral kernel design based semi-supervised learning. Advances in Neural Information Processing Systems (pp. 1601-1608).
28. Zhou, D., Bousquet, O., Lal, T. N., Weston, J., & Schölkopf, B. (2004). Learning with local and global consistency. Advances in Neural Information Processing Systems.
29. Zhu, X. (2005). Semi-supervised learning literature survey (Technical Report 1530). Computer Sciences, University of Wisconsin-Madison.
30. Zhu, X., Ghahramani, Z., & Lafferty, J. Semi-supervised learning using gaussian fields and harmonic functions. ICML (pp. 912-919).