Publisher's Synopsis
Using a hierarchical approach, the author shows that complex problems can be solved by breaking them down into smaller, simpler problems using the recently developed technique of automatic function definition in the context of genetic programming.;Where conventional techniques of machine learning and artificial intelligence fail to provide an effective means for automatically handling the process of decomposing complex problems into smaller subsets, reassembling the solutions to these subsets, and applying an overall solution to the original problem, automatic function definition enables genetic programming to define useful and reusable subroutines dynamically. This text illustrates this new technique by showing how it solves (or approximately solves) a variety of problems in Boolean function learning, symbolic regression, control, pattern recognition, robotics, classification, and molecular biology.;In each example, the problem is automatically decomposed into subproblems; the subproblems are automatically solved; and the solutions to the subproblems are automatically assembled into a solution to the original problem. It is shown that leverage accrues because genetic programming with automatic function definition repeatedly uses the solutions to the subproblems in the assembly of the solution to the overall problem. Moreover, genetic programming with automatic function definition produces solutions that are simpler and smaller than the solution obtained without automatic function definition.
