메뉴 건너뛰기




Volumn , Issue , 2008, Pages

Efficient convex relaxation for transductive Support Vector Machine

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; RELAXATION PROCESSES; SUPPORT VECTOR MACHINES;

EID: 85162020557     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (48)

References (16)
  • 1
    • 84898975526 scopus 로고    scopus 로고
    • Convex methods for transduction
    • S. Thrun, L. Saul, and B. Schölkopf, editors. MIT Press, Cambridge, MA
    • T. D. Bie and N. Cristianini. Convex methods for transduction. In S. Thrun, L. Saul, and B. Schölkopf, editors, Advances in Neural Information Processing Systems 16. MIT Press, Cambridge, MA, 2004.
    • (2004) Advances in Neural Information Processing Systems , vol.16
    • Bie, T.D.1    Cristianini, N.2
  • 4
    • 84864069202 scopus 로고    scopus 로고
    • Branch and bound for semi-supervised support vector machines
    • B. Schölkopf, J. Platt, and T. Hoffman, editors. MIT Press, Cambridge, MA
    • O. Chapelle, V. Sindhwani, and S. Keerthi. Branch and bound for semi-supervised support vector machines. In B. Schölkopf, J. Platt, and T. Hoffman, editors, Advances in Neural Information Processing Systems 19. MIT Press, Cambridge, MA, 2007.
    • (2007) Advances in Neural Information Processing Systems , vol.19
    • Chapelle, O.1    Sindhwani, V.2    Keerthi, S.3
  • 8
    • 0001938951 scopus 로고    scopus 로고
    • Transductive inference for text classification using support vector machines
    • San Francisco, CA, USA, Morgan Kaufmann Publishers Inc
    • T. Joachims. Transductive inference for text classification using support vector machines. In ICML '99: Proceedings of the Sixteenth International Conference on Machine Learning, pages 200-209, San Francisco, CA, USA, 1999. Morgan Kaufmann Publishers Inc.
    • (1999) ICML '99: Proceedings of the Sixteenth International Conference on Machine Learning , pp. 200-209
    • Joachims, T.1
  • 10
    • 0003630894 scopus 로고
    • Interior point polynomial methods in convex programming: Theory and applications
    • Philadelphia
    • Y. Nesterov and A. Nemirovsky. Interior point polynomial methods in convex programming: Theory and applications. Studies in Applied Mathematics. Philadelphia, 1994.
    • (1994) Studies in Applied Mathematics
    • Nesterov, Y.1    Nemirovsky, A.2
  • 12
    • 0033296299 scopus 로고    scopus 로고
    • Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones
    • J. F. Sturm. Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optimization Methods and Software, 11:625-653, 1999.
    • (1999) Optimization Methods and Software , vol.11 , pp. 625-653
    • Sturm, J.F.1
  • 13
    • 84864041449 scopus 로고    scopus 로고
    • Generalized maximum margin clustering and unsupervised kernel learning
    • B. Schölkopf, J. Platt, and T. Hoffman, editors, MIT Press, Cambridge, MA
    • H. Valizadegan and R. Jin. Generalized maximum margin clustering and unsupervised kernel learning. In B. Schölkopf, J. Platt, and T. Hoffman, editors, Advances in Neural Information Processing Systems 19. MIT Press, Cambridge, MA, 2007.
    • (2007) Advances in Neural Information Processing Systems , vol.19
    • Valizadegan, H.1    Jin, R.2
  • 14
    • 29344456217 scopus 로고    scopus 로고
    • Unsupervised and semi-supervised multi-class support vector machines
    • Proceedings of the 20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, AAAI-05/IAAI-05
    • L. Xu and D. Schuurmans. Unsupervised and semi-supervised multi-class support vector machines. In AAAI, pages 904-910, 2005. (Pubitemid 43006723)
    • (2005) Proceedings of the National Conference on Artificial Intelligence , vol.2 , pp. 904-910
    • Xu, L.1    Schuurmans, D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.