A novel SVM geometric algorithm based on reduced convex hulls

  • Mavroforakis M
  • Sdralis M
  • Theodoridis S
  • 22


    Mendeley users who have this article in their library.
  • 17


    Citations of this article.


Geometric methods are very intuitive and provide a theoretically solid viewpoint to many optimization problems. SVM is a typical optimization task that has attracted a lot of attention over the recent years in many pattern recognition and machine learning tasks. In this work, we exploit recent results in reduced convex hulls (RCH) and apply them to a nearest point algorithm (NPA) leading to an elegant and efficient solution to the general (linear and nonlinear, separable and non-separable) SVM classification task

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Michael E. Mavroforakis

  • Margaritis Sdralis

  • Sergios Theodoridis

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free