Skip to main content

A Polynomial Smooth Support Vector Machine for Classification

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3584))

Abstract

A new polynomial smooth method for solving the support vector machine (SVM) is presented in this paper. It is called the polynomial smooth support vector machine (PSSVM). BFGS method and Newton-Armijo method are applied to solve the PSSVM. Numerical experiments confirm that PSSVM is more effective than SVM.

Supported by the Youth Key Foundations of Univ. of Electronic Science and Technology of China (Jx04042) and NCET of China.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    MATH  Google Scholar 

  2. Lee, Y.-J., Mangarasian, O.L.: SSVM: A Smooth Support Vector Machine for Classification. Computational Optimization and Applications 22, 5–21 (2001)

    Article  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. Xu, C.X., Zhang, J.Z.: Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations, Technical Report, Department of Mathematics, City University of Hong Kong (1999)

    Google Scholar 

  5. Xu, C.X., Zhang, J.Z.: A syuvey of quasi-Newton equations and quasi-Newton methods for optimization. Annals of Operations Research 103, 213–234 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. Zhang, J.Z., Xu, C.X.: Properties and numerical performance of quasi- Newton methods with modified quasi-Newton equations. J. Comp. Appl. Math. 137, 269–278 (2001)

    Article  MATH  Google Scholar 

  7. Yuan, Y., Byrd, R.: Non-quasi-Newton updates for unconstrained optimization. J. Comp. Math. 13, 95–107 (1995)

    MATH  MathSciNet  Google Scholar 

  8. Yuan, Y., Sun, W.Y.: Optimal Method and Technology. Chinese Science Publisher (2000)

    Google Scholar 

  9. Yuan, Y.: A modified BFGS algorithm for unconstrained optimization. IMA J. Numer. Anal. 11, 325–332 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  10. Zhang, J.Z., Deng, N.Y., Chen, L.H.: New quasi-Newton equation and related methods for unconstrained optimization. J. Optim. Theory Appl. 102, 147–167 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  11. Mangasarian, O.L., Musicant, D.R.: Successive overrelaxation for support vector machines. IEEE Transactions on Neural Networks 10, 1032–1037 (1999), ftp://ftp.cs.wisc.edu/math-prog/techreports/98-18.ps

    Article  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

Yuan, Y., Huang, T. (2005). A Polynomial Smooth Support Vector Machine for Classification. In: Li, X., Wang, S., Dong, Z.Y. (eds) Advanced Data Mining and Applications. ADMA 2005. Lecture Notes in Computer Science(), vol 3584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527503_19

Download citation

  • DOI: https://doi.org/10.1007/11527503_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27894-8

  • Online ISBN: 978-3-540-31877-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics