Gene Expression Programming: a New Adaptive Algorithm for Solving Problems
| dc.creator | Ferreira, Candida | |
| dc.date | 2001-02-25 | |
| dc.date | 2001-12-30 | |
| dc.date.accessioned | 2026-07-07T03:16:58Z | |
| dc.date.available | 2026-07-07T03:16:58Z | |
| dc.description | Gene expression programming, a genotype/phenotype genetic algorithm (linear and ramified), is presented here for the first time as a new technique for the creation of computer programs. Gene expression programming uses character linear chromosomes composed of genes structurally organized in a head and a tail. The chromosomes function as a genome and are subjected to modification by means of mutation, transposition, root transposition, gene transposition, gene recombination, and one- and two-point recombination. The chromosomes encode expression trees which are the object of selection. The creation of these separate entities (genome and expression tree) with distinct functions allows the algorithm to perform with high efficiency that greatly surpasses existing adaptive techniques. The suite of problems chosen to illustrate the power and versatility of gene expression programming includes symbolic regression, sequence induction with and without constant creation, block stacking, cellular automata rules for the density-classification problem, and two problems of boolean concept learning: the 11-multiplexer and the GP rule problem. | |
| dc.description | 22 pages, 17 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0102027 | |
| dc.identifier | http://arxiv.org/abs/cs/0102027 | |
| dc.identifier | Complex Systems, 13(2): 87-129, 2001 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30555 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | Neural and Evolutionary Computing | |
| dc.subject | I.2.2 | |
| dc.title | Gene Expression Programming: a New Adaptive Algorithm for Solving Problems | |
| dc.type | text |