Title of article
An adaptive support vector regression based on a new sequence of unified orthogonal polynomials
Author/Authors
Zhao، نويسنده , , Jinwei and Yan، نويسنده , , Guirong and Feng، نويسنده , , Boqin and Mao، نويسنده , , Wentao and Bai، نويسنده , , Junqing، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
15
From page
899
To page
913
Abstract
In practical engineering, small-scale data sets are usually sparse and contaminated by noise. In this paper, we propose a new sequence of orthogonal polynomials varying with their coefficient, unified Chebyshev polynomials (UCP), which has two important properties, namely, orthogonality and adaptivity. Based on these new polynomials, a new kernel function, the unified Chebyshev kernel (UCK), is constructed, which has been proven to be a valid SVM kernel. To find the optimal polynomial coefficient and the optimal kernel, we propose an adaptive algorithm based on the evaluation criterion for adaptive ability of UCK. To evaluate the performance of the new method, we applied it to learning some benchmark data sets for regression, and compared it with other three algorithms. The experiment results show that the proposed adaptive algorithm has excellent generalization performance and prediction accuracy, and does not cost more time compared with other SVMs. Therefore, this method is suitable for practical engineering application.
Keywords
Chebyshev polynomials , Small sample , Generalization ability , Kernel function , Adaptable measures
Journal title
PATTERN RECOGNITION
Serial Year
2013
Journal title
PATTERN RECOGNITION
Record number
1735255
Link To Document