Optimization of bilinear time series models using fast evolutionary programming

This letter presents a new algorithm, fast evolutionary programming (FEP), for determining the model orders and parameters of reduced parameter bilinear (RPBL) models used for predicting nonlinear and chaotic time series. FEP is a variant of the conventional evolutionary programming (EP) algorithm with a new mutation operator. This new mutation operator enhances EP's ability to escape from local minima resulting in a significantly faster convergence to the optimal solution. Both the model order and the parameters are evolved simultaneously. Experimental results on the sunspot series and Mackey-Glass series show that FEP is capable of determining the optimal model order and, in comparison with conventional evolutionary programming, evolves models with lower normalized mean squared error.

[1]  D. Fogel System Identification Through Simulated Evolution: A Machine Learning Approach to Modeling , 1991 .

[2]  Sathyanarayan S. Rao,et al.  Design of discrete coefficient FIR filters by simulated evolution , 1996, IEEE Signal Processing Letters.

[3]  Martin T. Hagan,et al.  A reduced parameter bilinear time series model , 1994, IEEE Trans. Signal Process..

[4]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[5]  Xin Yao,et al.  Fast Evolutionary Programming , 1996, Evolutionary Programming.

[6]  Donald E. Waagen,et al.  Evolving recurrent perceptrons for time-series modeling , 1994, IEEE Trans. Neural Networks.

[7]  David B. Fogel,et al.  Meta-evolutionary programming , 1991, [1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers.

[8]  Thomas Bäck,et al.  An Overview of Evolutionary Algorithms for Parameter Optimization , 1993, Evolutionary Computation.