Learning kernels for support vector machines with polynomial powers of sigmoid

• Autor(a) principal: Fernandes, Silas E. N.
• Data de Publicação: 2014
• Outros Autores: Pilastri, Andre Luiz, Pereira, Luis A. M., Pires, Rafael G. [UNESP], Papa, João P. [UNESP]
• Tipo de documento: Artigo de conferência
• Idioma: eng
• Título da fonte: Repositório Institucional da UNESP
• Texto Completo: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6915316; http://hdl.handle.net/11449/130175
• topic: Machine learning; Kernel functions; Polynomial powers of sigmoid; PPS-Radial; Support vector machines

In the pattern recognition research field, Support Vector Machines (SVM) have been an effectiveness tool for classification purposes, being successively employed in many applications. The SVM input data is transformed into a high dimensional space using some kernel functions where linear separation is more likely. However, there are some computational drawbacks associated to SVM. One of them is the computational burden required to find out the more adequate parameters for the kernel mapping considering each non-linearly separable input data space, which reflects the performance of SVM. This paper introduces the Polynomial Powers of Sigmoid for SVM kernel mapping, and it shows their advantages over well-known kernel functions using real and synthetic datasets.