Created by W.Langdon from gp-bibliography.bib Revision:1.8051
In a previous paper, the poor accuracy of Symbolic Regression was explored, and several classes of test formulae, which prove intractable for SR, were examined. An understanding of why these test problems prove intractable was developed. In another paper a baseline Symbolic Regression algorithm was developed with specific techniques for optimising embedded real numbers constants. These previous steps have placed us in a position to make an attempt at vanquishing the SR accuracy problem.
In this chapter we develop a complex algorithm for modern symbolic regression which is extremely accurate for a large class of Symbolic Regression problems. The class of problems, on which SR is extremely accurate, is described in detail. A definition of extreme accuracy is provided, and an informal argument of extreme SR accuracy is outlined in this chapter. Given the critical importance of accuracy in SR, it is our suspicion that in the future all commercial Symbolic Regression packages will use this algorithm or a substitute for this algorithm.",
Part of \cite{Riolo:2013:GPTP} published after the workshop in 2013",
Genetic Programming entries for Michael Korns