Exact semismooth newton SVM

  • Authors:
  • Zhou Shui-Sheng;Liu Hong-Wei;Cui Jiang-Tao;Zhou Li-Hua

  • Affiliations:
  • School of Science, Xidian University, Xi'an, P.R. China;School of Science, Xidian University, Xi'an, P.R. China;School of Computer, Xidian University, Xi'an, P.R. China;School of Computer, Xidian University, Xi'an, P.R. China

  • Venue:
  • ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part I
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Support vector machines can be posed as quadratic program problems in a variety of ways.This paper investigates a formulation using the two-norm for the misclassification error and appending a bias norm to objective function that leads to a positive definite quadratic program only with the nonnegative constraint under a duality construction. An unconstrained convex program problem, which minimizes a differentiable convex piecewise quadratic function, is proposed as the Lagrangian dual of the quadratic program. Then an exact semismooth Newton support vector machine (ESNSVM) is obtained to solve the program speedily. Some numerical experiments demonstrate that our algorithm is very efficient comparing with the similar algorithms such as LSVM.