Unsupervised and semi-supervised multi-class support vector machines

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2005, Pages 904-910

  Xu, Linli ^a   Schuurmans, Dale ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

SEMIDEFINITE PROGRAMMING; SUPPORT VECTOR MACHINES (SVMS); TRAINING ALGORITHMS; TRAINING DATA;

CLASSIFICATION (OF INFORMATION); COMPUTER SYSTEMS PROGRAMMING; DATA REDUCTION; LEARNING ALGORITHMS; SUPERVISORY AND EXECUTIVE PROGRAMS;

LEARNING SYSTEMS;

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

References (20)

1. Altun, Y.; Tsochantaridis, I.; and Hofmann, T. 2003, Hidden Markov support vector machines. In Proceedings International Conference on Machine Learning (ICML-03).
2. Bansal, N.; Blum, A.; and Chawla, S. 2002. Correlation clustering. In Conference on Foundations of Computer Science (FOCS-02).
3. Bennett, K., and Demiriz, A. 1998. Semi-supervised sup port vector machines. In Advances in Neural Information Processing Systems 11 (NIPS-98).
4. Boyd, S., and Vandenberghe, L. 2004. Convex Optimization. Cambridge U. Press.
5. Crammer, K., and Singer, Y. 2001. On the algorithmic interpretation of multiclass kernel-based vector machines. Journal of Machine Learning Research 2.
6. De Bie, T., and Cristianini, N. 2003. Convex methods for transduction. In Advances in Neural Information Processing Systems 16 (NIPS-03).
7. Goemans, M., and Williamson, D. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semjdefinite programming. JACM 42:1115-1145.
8. Graepel, T., and Herbrich, R. 2003. Invariant pattern recognition by semidefinite programming machines. In Advances in Neural Information Processing Systems 16 (NIPS-03).
9. Helmberg, C. 2000. Semidefinite programming for com binatorial optimization. Technical Report ZIB-Report ZR-00-34, Konrad-Zuse-Zentrum Berlin.
10. Joachims, T. 1999. Transductive inference for text classification using support vector machines. In International Conference on Machine Learning (ICML-99).
11. Lanckriet, G.; Cristianini, N.; Bartlett, P.; Ghaoui, L.; and Jordan, M. 2004. Learning the kernel matrix with semidefinite programming. Journal of Machine Learning Research 5.
12. Laurent, M., and Poljak, S. 1995. On a positive semidefinite relaxation of the cut polytope. Linear Algebra and its Applications 223/224.
13. Nesterov, Y., and Nimirovskii, A. 1994. Interior-Point Polynomial Algorithms in Convex Programming. SIAM.
14. Ng, A.; Jordan, M.; and Weiss, Y. 2001. On spectral clustering: analysis and an algorithm. In Advances in Neural Information Processing Systems 14 (NIPS-01).
15. Schoelkopf, B., and Smola, A. 2002. Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. MIT Press.
16. Strang, G. 1998. Introduction to Linear Algebra. Wellesley-Cambridge Press.
17. Taskar, B.; Guestrin, C.; and Koller, D. 2003. Max-margin Markov networks. In Advances in Neural Information Processing Systems 16 (NIPS-03).
18. Tsochantaridis, I.; Hofmann, T.; Joachims, T.; and Altun, Y. 2004. Support vector machine learning for interdependent and structured output spaces. In Proceedings International Conference on Machine Learning (ICML-04).
19. Vanderbei, R. 1996. Linear Programming: Foundations and Extensions. Kluwer.
20. Xu, L.; Neufeld, J.; Larson, B.; and Schuurmans, D. 2004. Maximum margin clustering. In Advances in Neural Information Processing Systems 17 (NIPS-04).