Skip to main content

Learning SVM Kernel with Semi-definite Programming

  • Conference paper
Advances in Natural Computation (ICNC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3610))

Included in the following conference series:

  • 1474 Accesses

Abstract

It is well-known that the major task of the SVM approach lies in the selection of its kernel. The quality of kernel will determine the quality of SVM classifier directly. However, the best choice of a kernel for a given problem is still an open research issue. This paper presents a novel method which learns SVM kernel by transforming it into a standard semi-definite programming (SDP) problem and then solves this SDP problem using various existing methods. Experimental results are presented to prove that SVM with the kernel learned by our proposed method outperforms that with a single common kernel in terms of generalization power.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Vapnik, V.N.: The Nature of Statistical Learning Theory. Springer, Heidelberg (1995)

    MATH  Google Scholar 

  2. Scholkopf, B., Smola, A., Muler, K.-R.: Nonlinear Component Analysis as a Kernel Eigenvalue Problem. Neural Computation, 1299–1319 (1998)

    Google Scholar 

  3. Burges, C.J.C.: A Tutorial on Support Vector Machines for Pattern Recognition. Data Mining and Knowledge Discovery 2, 121–167 (1998)

    Article  Google Scholar 

  4. Vandenberghe, L., Boyd, S.: Semidefinite Programming. SIAM Review, 49–95 (1996)

    Google Scholar 

  5. Lanckriet, G.R.G., Cristianini, N., Bartlett, P., El Ghaoui, L., Jordan, M.I.: Learning the Kernel Matrix with Semi-Definite Programming. The Journal of Machine Learning Research 5, 27–72 (2004)

    Google Scholar 

  6. Tan, Y., Wang, J.: A Support Vector Machine with a Hybrid Kernel and Minimal Vapnik-Chervonenkis Dimension. IEEE Transactions on Knowledge and Data Engineering, 385–395 (2004)

    Google Scholar 

  7. Hsu, C.-W., Lin, C.-J.: A Comparison of Methods for Multiclass Support Vector Machines. IEEE Transactions on Neural Networks, 415–425 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, S., Luo, S. (2005). Learning SVM Kernel with Semi-definite Programming. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539087_94

Download citation

  • DOI: https://doi.org/10.1007/11539087_94

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28323-2

  • Online ISBN: 978-3-540-31853-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics