The infinite polynomial kernel for support vector machine

Authors:
Degang Chen;Qiang He;Xizhao Wang
Affiliations:
Department of Mathematics and Physics, North China Electric Power University, Beijing, China;Department of Mathematics and Computer Science, Hebei University, Baoding, Hebei, China;Department of Mathematics and Computer Science, Hebei University, Baoding, Hebei, China
Venue:
ADMA'05 Proceedings of the First international conference on Advanced Data Mining and Applications
Year:
2005

Citing 3
Cited 2

The nature of statistical learning theory

The nature of statistical learning theory
Pattern classification: a unified view of statistical and neural approaches

Pattern classification: a unified view of statistical and neural approaches
A Tutorial on Support Vector Machines for Pattern Recognition

Data Mining and Knowledge Discovery

On linear separability of data sets in feature space

Neurocomputing
A method to construct the mapping to the feature space for the dot product kernels

ICMLC'05 Proceedings of the 4th international conference on Advances in Machine Learning and Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper develops an infinite polynomial kernel kc for support vector machines. We also propose a mapping from an original data space into the high dimensional feature space on which the inner product is defined by the infinite polynomial kernel kc . Via this mapping, any two finite sets of data in the original space will become linearly separable in the feature space. Numerical experiments indicate that the proposed infinite polynomial kernel possesses some properties and performance better than the existing finite polynomial kernels.