Selection of Basis Functions Guided by the L2 Soft Margin

Support Vector Machines (SVMs) for classification tasks produce sparse models by maximizing the margin. Two limitations of this technique are considered in this work: firstly, the number of support vectors can be large and, secondly, the model requires the use of (Mercer) kernel functions. Recently, some works have proposed to maximize the margin while controlling the sparsity. These works also require the use of kernels. We propose a search process to select a subset of basis functions that maximize the margin without the requirement of being kernel functions. The sparsity of the model can be explicitly controlled. Experimental results show that accuracy close to SVMs can be achieved with much higher sparsity. Further, given the same level of sparsity, more powerful search strategies tend to obtain better generalization rates than simpler ones.

• Type: Conference
• Year: 2007
• Where: ICANN
• Authors: Ignacio Barrio, Enrique Romero, Lluís Belanche
• Keywords: ICANN 2007, Kernel Functions, Support Vector Machines, Support Vectors