- author = "Nikolay I. Nikolaev and Hitoshi Iba",
- title = "Accelerated Genetic Programming of Polynomials",
- journal = "Genetic Programming and Evolvable Machines",
- year = "2001",
- volume = "2",
- number = "3",
- pages = "231--257",
- month = sep,
- keywords = "genetic algorithms, genetic programming",
- ISSN = "1389-2576",
-
URL = "
https://rdcu.be/cT1sb",
-
DOI = "
10.1023/A:1011949326249",
- abstract = "An accelerated polynomial construction technique for genetic programming is proposed. This is a horizontal technique for gradual expansion of a partial polynomial during traversal of its tree-structured representation. The coefficients of the partial polynomial and the coefficient of the new term are calculated by a rapid recurrent least squares (RLS) fitting method. When used for genetic programming (GP) of polynomials this technique enables us not only to achieve fast estimation of the coefficients, but also leads to power series models that differ from those of traditional Koza-style GP and from those of the previous GP with polynomials STROGANOFF. We demonstrate that the accelerated GP is sucessful in that it evolves solutions with greater generalization capacity than STROGANOFF and traditional GP on symbolic regression, pattern recognition, and financial time-series prediction tasks.",
-
notes = "Article ID: 357594
Department of Mathematics & Computing Sciences, Goldsmiths College, University of London, New Cross, London, SE14 6NW, United Kingdom",
