A set of new Chebyshev kernel functions for support vector machine pattern classification

Sedat Özer

doi:10.1016/j.patcog.2010.12.017

2011-07-01

PRE

Sedat Özer *

Hakan Ali Çırpan

DOI：10.1016/j.patcog.2010.12.017

原文链接

原文求助

摘要

En 中文

In this study, we introduce a set of new kernel functions derived from the generalized Chebyshev polynomials. The proposed generalized Chebyshev polynomials allow us to derive different kernel functions. By using these polynomial functions, we generalize recently introduced Chebyshev kernel function for vector inputs and, as a result, we obtain a robust set of kernel functions for Support Vector Machine (SVM) classification. Thus in this study, besides clarifying how to apply the Chebyshev kernel functions on vector inputs, we also increase the generalization capability of the previously proposed Chebyshev kernels and show how to derive new kernel functions by using the generalized Chebyshev polynomials. The proposed set of kernel functions provides competitive performance when compared to all other common kernel functions on average for the simulation datasets. The results indicate that they can be used as a good alternative to other common kernel functions for SVM classification in order to obtain better accuracy. Moreover, test results show that the generalized Chebyshev kernel approaches to the minimum support vector number for classification in general. (c) 2011 Elsevier Ltd. All rights reserved.

Keyword:

Generalized Chebyshev kernel

Modified Chebyshev kernel

Semi-parametric kernel

Kernel construction