Accelerated Genetic Programming of Polynomials

Nikolaev, Nikolay and Iba, Hitoshi. 2001. Accelerated Genetic Programming of Polynomials. Genetic Programmimg and Evolvable Machines, 2(3), pp. 231-257. ISSN 1389-2576 [Article]

No full text available

Abstract or Description

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.

Item Type:


Identification Number (DOI):

Departments, Centres and Research Units:



September 2001Published

Item ID:


Date Deposited:

08 Jan 2016 14:52

Last Modified:

20 Jun 2017 11:17

Peer Reviewed:

Yes, this version has been peer-reviewed.


Edit Record Edit Record (login required)