Support Vector Machine with Composite Kernels for Time Series Prediction

In Support Vector Machine (SVM), Kernels are employed to map the nonlinear model into a higher dimensional feature space where the linear learning is adopted. The characteristics of kernels have great impacts on learning and predictive results of SVM. Considering the characteristics for fitting and generalization of two kinds of typical kernels---global kernel (polynomial kernel) and local kernel (RBF kernel), a new kind of SVM modeling method based on composite kernels is proposed. In order to evaluate the reasonable fitness of kernel functions, the particle swarm optimization (PSO) algorithm is used to adaptively evolve SVM to obtain the best prediction performance, in which each particle represented as a real vector corresponds to a set of the candidate parameters of SVM. Experiments in time series prediction demonstrate that the SVM with composite kernels has the better performance than with a single kernel.

[1]  Bernhard Schölkopf,et al.  Learning with kernels , 2001 .

[2]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[3]  Vladimir N. Vapnik,et al.  The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.

[4]  F. Tay,et al.  Application of support vector machines in financial time series forecasting , 2001 .

[5]  J. Mercer Functions of Positive and Negative Type, and their Connection with the Theory of Integral Equations , 1909 .

[6]  Gunnar Rätsch,et al.  Input space versus feature space in kernel-based methods , 1999, IEEE Trans. Neural Networks.

[7]  F. Girosi,et al.  Nonlinear prediction of chaotic time series using support vector machines , 1997, Neural Networks for Signal Processing VII. Proceedings of the 1997 IEEE Signal Processing Society Workshop.

[8]  Guido Smits,et al.  Improved SVM regression using mixtures of kernels , 2002, Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290).