A model for a complex polynomial SVM kernel

  • Authors:
  • Dana Simian

  • Affiliations:
  • University Lucian Blaga of Sibiu, Faculty of Sciences, Department of Computer Science, Sibiu, Romania

  • Venue:
  • SMO'08 Proceedings of the 8th conference on Simulation, modelling and optimization
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

SVM models are obtained by convex optimization and are able to learn and generalize in high dimensional input spaces. The kernel method is a very powerful idea. Using an appropriate kernel, the data are projected in a space with higher dimension in which they are separable by an hyperplane. Usually simple kernels are used but the real problems require more complex kernels. The aim of this paper is to introduce and analyze a multiple kernel based only on simple polynomials kernels.