Evolving Computer Programs for Knowledge Discovery

Genetic Programming (GP) offers practical advantages to the researcher facing difficult optimization problems. These advantages are multifold, including the simplicity of the approach, its robust response to changing circumstance, its flexibility, and many other facets. GP can be applied to problems where heuristic solutions are not available or generally lead to unsatisfactory results. As a result, GP has recently received increased interest, particularly with regard to the manner in which they may be applied for practical problem solving. This paper illustrates how some GP variants could be used for knowledge discovery and function approximation.