• DocumentCode
    2396812
  • Title

    A comparison among four SVM classification methods: LSVM, NLSVM, SSVM and NSVM

  • Author

    Lu, Shu-xia ; Wang, Zhao

  • Author_Institution
    Machine Learning Center, Hebei Univ., Baoding, China
  • Volume
    7
  • fYear
    2004
  • fDate
    26-29 Aug. 2004
  • Firstpage
    4277
  • Abstract
    Support vector machines (SVMs) are powerful tools for providing solutions to classification and function approximation problems. The comparison among the four classification methods is conducted. The four methods are Lagrangian support vector machine (LSVM), finite Newton Lagrangian support vector machine (NLSVM), smooth support vector machine (SSVM) and finite Newton support vector machine (NSVM). The comparison of their algorithm in generating a linear or nonlinear kernel classifier, accuracy and computational complexity is also given. The study provides some guidelines for choosing an appropriate one from four SVM classification methods in a classification problem.
  • Keywords
    Newton method; approximation theory; computational complexity; function approximation; nonlinear functions; pattern classification; support vector machines; SVM classification problems; computational complexity; finite Newton Lagrangian support vector machine; function approximation problem; linear kernel classifier; nonlinear kernel classifier; smooth support vector machine; Computational complexity; Computer science; Guidelines; Iterative algorithms; Kernel; Lagrangian functions; Mathematics; Newton method; Support vector machine classification; Support vector machines;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on
  • Print_ISBN
    0-7803-8403-2
  • Type

    conf

  • DOI
    10.1109/ICMLC.2004.1384589
  • Filename
    1384589