abstract = "Genetic Programming (GP) which mimics the natural
evolution to optimise functions and programs, has been
applied to many problems. In recent years, evolutionary
algorithms are seen from the viewpoint of the
estimation of distribution. Many algorithms called EDAs
(Estimation of Distribution Algorithms) based on
probabilistic techniques have been proposed. Although
probabilistic context free grammar (PCFG) is often used
for the function and program evolution, it assumes the
independence among the production rules. With this
simple PCFG, it is not able to induce the
building-blocks from promising solutions. We have
proposed a new function evolution algorithm based on
PCFG using latent annotations which weaken the
independence assumption. Computational experiments on
two subjects (the royal tree problem and the DMAX
problem) demonstrate that our new approach is highly
effective compared to prior approaches.",
notes = "CEC 2007 - A joint meeting of the IEEE, the EPS, and
the IET.