Analysis of Legendre polynomial kernel in support vector machines
kernel trickorthogonal polynomialsreproducing kernel Hilbert spacesupport vector machineSVMtensor product
Applications of hypergeometric functions (33C90) Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces) (46E22) Learning and adaptive systems in artificial intelligence (68T05) Applications of mathematical programming (90C90)
Summary: 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.
- On the influence of the kernel on the consistency of support vector machines
- New Hermite orthogonal polynomial kernel and combined kernels in support vector machine classifier
- A note on support vector machines with polynomial kernels
- Approximation with polynomial kernels and SVM classifiers
- A set of new Chebyshev kernel functions for support vector machine pattern classification
This page was built for publication: Analysis of Legendre polynomial kernel in support vector machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224401)
