A Novel Multiple Support Vector Machines Architecture for Chaotic Time Series Prediction
Inspired by the so-called “divide-and-conquer” principle that is often used to attack a complex problem by dividing it into simpler problems, a two-stage multiple support vector machines (SVMs) architecture is proposed to improve its prediction accuracy and generalization performance for chaotic time series prediction. Fuzzy C-means (FCM) clustering algorithm is adopted in the first stage to partition the input dataset into several subnets. Then, in the second stage, multiple SVMs that best fit partitioned subsets are constructed by Gaussian radial basis function kernel and the optimal free parameters of SVMs. All the models are evaluated by Mackey-Glass chaotic time series and used for coal mine gas concentration in the experiment. The simulation shows that the multiple SVMs achieve significant improvement in the generalization performance in comparison with the single SVM model. In addition, the multiple SVMs also converges faster and uses fewer support vectors.
KeywordsSupport Vector Machine Root Mean Square Error Cluster Center Chaotic Time Series Gaussian Radial Basis Function Kernel
Unable to display preview. Download preview PDF.
- 3.Cristianini, N., Taylor, J.S.: An Introduction to Support Vector Machines: and Other Kernel-based Learning Methods. Cambridge University Press, New York (2000)Google Scholar
- 9.Wan, W., Hirasawa, K., Hu, J.: Relation between Weight Initialization of Neural networks and Pruning Algorithms Case Study on Mackey-Glass Time Series. In: Proceedings of the International Joint Conference on Neural Networks, pp. 1750–1755 (2001)Google Scholar