Automatic Grammar Complexity Reduction in Grammatical Evolution
|Title:||Automatic Grammar Complexity Reduction in Grammatical Evolution||Authors:||Nicolau, Miguel||Permanent link:||http://hdl.handle.net/10197/8327||Date:||30-Jun-2004||Online since:||2017-02-06T17:25:42Z||Abstract:||Grammatical Evolution is an automatic programming system, where a population of binary strings is evolved, from which phenotype strings are generated through a mapping process, that employs a grammar to define the syntax of such output strings. This paper presents a study of the effect of grammar size and complexity on the performance of the system. A simple method to reduce the number of non-terminal symbols in a grammar is presented, along with the reasoning behind it. Results obtained on a series of problems suggest that performance can be increased with the approach presented.||Type of material:||Conference Publication||Keywords:||Grammatical evolution; Genetic programming||Other versions:||http://www.sigevo.org/gecco-2004/workshops/index.html||Language:||en||Status of Item:||Peer reviewed||Conference Details:||The 3rd Grammatical Evolution Workshop: A workshop of the 2004 Genetic and Evolutionary Computation Conference (GECCO-2004), Seattle, Washington, USA, 26-30 June 2004|
|Appears in Collections:||Business Research Collection|
Show full item record
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.