A novel SVM Geometric Algorithm based on Reduced Convex Hulls

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.

• Type: Conference
• Year: 2006
• Where: ICPR
• Authors: Michael E. Mavroforakis, Margaritis Sdralis, Sergios Theodoridis
• Keywords: Computer Vision, ICPR 2006, Reduced Convex Hulls, SVM Classification Task, Typical Optimization Task