@incollection{koza:1998:WYNNE,
	title = {Using biology to solve a problem in automated machine
                 learning},
	address = {Hillsdale, NJ, USA},
	author = {John R. Koza},
	booktitle = {Models of Action: Mechanisms for Adaptive Behavior},
	chapter = {5},
	editor = {Clive Wynne and John Staddon},
	note = {In Press},
	pages = {157--199},
	publisher = {Lawrence Erlbaum Associates},
	url = {http://www.genetic-programming.com/jkpdf/wynnestaddon1998.pdf},
	year = {1998},
	biburl = {http://www.bibsonomy.org/bibtex/241ff93c397c32d24786f513a83de80d6/brazovayeye},
	abstract = {This chapter describes how the biological theory of
                 gene duplication described in Susumu Ohno's provocative
                 book, Evolution by Means of Gene Duplication, was
                 brought to bear on a vexatious problem from the domain
                 of automated machine learning. The goal of automatic
                 programming is to create, in an automated way, a
                 computer program that enables a computer to solve a
                 problem. Ideally, an automatic programming system
                 should require that the user pre-specify little about
                 the problem environment. Genetic programming is a
                 domain-independent approach to automated machine
                 learning that attempts to evolve a computer program
                 that solves, or approximately solves, problems.
                 Starting with a primordial ooze of randomly generated
                 computer programs composed of the available
                 programmatic ingredients, genetic programming applies
                 the principles of animal husbandry (including Darwinian
                 selection and sexual recombination) to breed new (and
                 often improved) populations of computer programs. One
                 of the undesirable aspects of many techniques of
                 automated machine learning is that the user of the
                 technique may be required to specify the size and shape
                 (i.e., the architecture) of the ultimate solution to
                 his problem before he can begin to apply the technique
                 to his problem. Specification of the size and shape of
                 the solution often corresponds to discovering a way to
                 decompose the problem into useful subspaces (usually of
                 lower dimensionality) or to discovering a congenial
                 representation of the problem that facilitates solution
                 of the problem. Thus, in practice, for many problems of
                 interest, determining the size and shape of the
                 solution may be the problem (or at least a substantial
                 part of the problem). This chapter describes how
                 biology motivated a solution to the problem of
                 architecture discovery for genetic programming. The
                 resulting biologically-motivated approach enables
                 genetic programming to automatically discover the size
                 and shape of the solution at the same time as genetic
                 programming is evolving a solution to the problem. This
                 is accomplished using six new architecture-altering
                 operations that provide a way to automatically
                 discover, during a run of genetic programming, both the
                 architecture and the sequence of steps of a multi-part
                 computer program that will solve the given problem.},
	size = {75 pages},
	keywords = {algorithms, genetic programming }
}