Genetic programming (or GP) is a random search technique that emerged in the late 1980s and early 1990s. A formal description of the method was introduced in Koza (1992). GP applies to many optimization areas. One of them is modeling time series and using those models in forecasting. Unlike other modeling techniques, GP is a computer program that 'searches' for a specification that replicates the dynamic behavior of observed series. To use GP, one provides operators (such as +, -, *, ?, exp, log, sin, cos, ... etc.) and identifies as many variables thought best to reproduce the dependent variable's dynamics. The program then randomly assembles equations with different specifications by combining some of the provided variables with operators and identifies that specification with the minimum sum of squared errors (or SSE). This process is an iterative evolution of successive generations consisting of thousands of the assembled equations where only the fittest within a generation survive to breed better equations also using random combinations until the best one is found. Clearly from this simple description, the method is based on heuristics and has no theoretical foundation. However, resulting final equations seem to produce reasonably accurate forecasts that compare favorably to forecasts humanly conceived specifications produce. With encouraging results difficult to overlook or ignore, it is important to investigate GP as a forecasting methodology. This paper attempts to evaluate forecasts genetically evolved models (or GEMs) produce for experimental data as well as real world time series.The organization of this paper inot four Sections. Section 1 contains an overview of GEMs. The reader will find lucid explanation of how models are evolved using genetic methodology as well as features found to characterize GEMs as a modeling technique. Section 2 contains descriptions of simulated and real world data and their respective fittest identified GEMs. The MSE and a new alpha-statistic are presented to compare models' performances. Simulated data were chosen to represent processes with different behavioral complexities including linear, linear-stochastic, nonlinear, nonlinear chaotic, and nonlinear-stochastic. Real world data consist of two time series popular in analytical statistics: Canadian lynx data and sunspot numbers. Predictions of historic values of each series (used in generating the fittest model) are also presented there. Forecasts and their evaluations are in Section 3. For each series, single- and multi-step forecasts are evaluated according to the mean squared error, normalized mean squared error, and alpha- statistic. A few concluding remarks are in the discussion in Section 4.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Length: Date of creation: 05 Jul 2000 Date of revision: Handle: RePEc:sce:scecf0:331
Contact details of provider: Postal: CEF 2000, Departament d'Economia i Empresa, Universitat Pompeu Fabra, Ramon Trias Fargas, 25,27, 08005, Barcelona, Spain Fax: +34 93 542 17 46 Email: Web page: http://enginy.upf.es/SCE/ More information through EDIRC
For technical questions regarding this item, or to correct its listing, contact: (Christopher F. Baum).