Abstract
The use of protected operators and squared error measures are standard approaches in symbolic regression. It will be shown that two relatively minor modifications of a symbolic regression system can result in greatly improved predictive performance and reliability of the induced expressions. To achieve this, interval arithmetic and linear scaling are used. An experimental section demonstrates the improvements on 15 symbolic regression problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. W. Davidson, D. A. Savic, and G. A. Walters, Method for the identification of explicit polynomial formulae for the friction in turbulent pipe flow, Journal of Hydroinformatics 1 (1999), no. 2, 115–126.
Eldon Hansen, Global optimization using interval analysis, Dekker, New York, 1992.
Hugo Hiden, Ben McKay, Mark Willis, and Gary Montague, Non-linear partial least squares using genetic programming, Genetic Programming 1998: Proceedings of the Third Annual Conference (University of Wisconsin, Madison, Wisconsin, USA) (John R. Koza, Wolfgang Banzhaf, Kumar Chellapilla, Kalyanmoy Deb, Marco Dorigo, David B. Fogel, Max H. Garzon, David E. Goldberg, Hitoshi Iba, and Rick Riolo, eds.), Morgan Kaufmann, 22–25 July 1998, pp. 128–133.
Hugo Hiden, Mark Willis, Ming Tham, Paul Turner, and Gary Montague, Nonlinear principal components analysis using genetic programming, Second International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, GALESIA (University of Strathclyde, Glasgow, UK) (Ali Zalzala, ed.), Institution of Electrical Engineers, 1–4 September 1997.
Daniel Howard and Simon C. Roberts, Genetic programming solution of the convection-diffusion equation, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001) (San Francisco, California, USA) (Lee Spector, Erik D. Goodman, Annie Wu, W. B. Langdon, Hans-Michael Voigt, Mitsuo Gen, Sandip Sen, Marco Dorigo, Shahram Pezeshk, Max H. Garzon, and Edmund Burke, eds.), Morgan Kaufmann, 7–11 July 2001, pp. 34–41.
Hitoshi Iba, Hugo de Garis, and Taisuke Sato, Genetic programming using a minimum description length principle, Advances in Genetic Programming (Kenneth E. Kinnear, Jr., ed.), MIT Press, 1994, pp. 265–284.
Hitoshi Iba and Nikolay Nikolaev, Genetic programming polynomial models of financial data series, Proceedings of the 2000 Congress on Evolutionary Computation CEC00 (La Jolla Marriott Hotel La Jolla, California, USA), IEEE Press, 6–9 July 2000, pp. 1459–1466.
Colin Johnson, Deriving genetic programming fitness properties by static analysis, Genetic Programming, Proceedings of the 5th European Conference, EuroGP 2002 (Kinsale, Ireland) (James A. Foster, Evelyne Lutton, Julian Miller, Conor Ryan, and Andrea G. B. Tettamanzi, eds.), LNCS, vol. 2278, Springer-Verlag, 3–5 April 2002, pp. 298–307.
Maarten Keijzer and Vladan Babovic, Genetic programming, ensemble methods and the bias/variance tradeoff-introductory investigations, Genetic Programming, Proceedings of EuroGP’2000 (Edinburgh) (Riccardo Poli, Wolfgang Banzhaf, William B. Langdon, Julian F. Miller, Peter Nordin, and Terence C. Fogarty, eds.), LNCS, vol. 1802, Springer-Verlag, 15–16 April 2000, pp. 76–90.
John R. Koza, Genetic programming: On the programming of computers by means of natural selection, MIT Press, Cambridge, MA, USA, 1992.
Ben McKay, Mark Willis, Dominic Searson, and Gary Montague, Non-linear continuum regression using genetic programming, Proceedings of the Genetic and Evolutionary Computation Conference (Orlando, Florida, USA) (Wolfgang Banzhaf, Jason Daida, Agoston E. Eiben, Max H. Garzon, Vasant Honavar, Mark Jakiela, and Robert E. Smith, eds.), vol. 2, Morgan Kaufmann, 13–17 July 1999, pp. 1106–1111.
Nikolay Y. Nikolaev and Hitoshi Iba, Regularization approach to inductive genetic programming, IEEE Transactions on Evolutionary Computing 54 (2001), no. 4, 359–375.
R. P. Salustowicz and J. Schmidhuber, Probabilistic incremental program evolution, Evolutionary Computation 5 (1997), no. 2, 123–141.
Luciano Sanchez, Interval-valued GA-P algorithms, IEEE Transactions on Evolutionary Computation 4 (2000), no. 1, 64–72.
Matthew Streeter and Lee A. Becker, Automated discovery of numerical approximation formulae via genetic programming, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001) (San Francisco, California, USA) (Lee Spector, Erik D. Goodman, Annie Wu, W. B. Langdon, Hans-Michael Voigt, Mitsuo Gen, Sandip Sen, Marco Dorigo, Shahram Pezeshk, Max H. Garzon, and Edmund Burke, eds.), Morgan Kaufmann, 7–11 July 2001, pp. 147–154.
Alexander Topchy and W. F. Punch, Faster genetic programming based on local gradient search of numeric leaf values, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001) (San Francisco, California, USA) (Lee Spector, Erik D. Goodman, Annie Wu, W. B. Langdon, Hans-Michael Voigt, Mitsuo Gen, Sandip Sen, Marco Dorigo, Shahram Pezeshk, Max H. Garzon, and Edmund Burke, eds.), Morgan Kaufmann, 7–11 July 2001, pp. 155–162.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Keijzer, M. (2003). Improving Symbolic Regression with Interval Arithmetic and Linear Scaling. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E., Poli, R., Costa, E. (eds) Genetic Programming. EuroGP 2003. Lecture Notes in Computer Science, vol 2610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36599-0_7
Download citation
DOI: https://doi.org/10.1007/3-540-36599-0_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00971-9
Online ISBN: 978-3-540-36599-0
eBook Packages: Springer Book Archive