A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is
Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)
This research presents an evaluation of user defined domain specific functions of genetic programming using relational learning problems, generalisation for this class of learning problems and learning bias. After providing a brief theoretical background, two sets of experiments are detailed: experiments and results concerning the Monk-2 problem and experiments attempting to evolve generalising solutions to parity problems with incomplete data sets. The results suggest that using nonproblemdoi:10.1109/cec.2000.870815 fatcat:qduhsyockrch3lnplz5eaaufwe