Analysis of legendre polynomial kernel in support vector machines Online publication date: Mon, 09-Dec-2019
by Naima Djelloul; Abdessamad Amir
International Journal of Computing Science and Mathematics (IJCSM), Vol. 10, No. 6, 2019
Abstract: For several types of machines learning problems, the support vector machine is a method of choice. The kernel functions are a basic ingredient in support vector machine theory. Kernels based on the concepts of orthogonal polynomials gave the great satisfaction in practice. In this paper we identify the reproducing kernel Hilbert space of legendre polynomial kernel which allows us to understand its ability to extract more discriminative features. We also show that without being a universal kernel, legendre kernel possesses the same separation properties. The legendre, Gaussian and polynomial kernel performance has been first evaluated on two dimensional illustrative examples in order to give a graphical comparison, then on real world data sets from UCI repository. For nonlinearly separable data, legendre kernel always gives satisfaction regarding classification accuracy and reduction in the number of support vectors.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook