Tree-adjunct grammatical evolution
|Title:||Tree-adjunct grammatical evolution||Authors:||Murphy, Eoin
|Permanent link:||http://hdl.handle.net/10197/2558||Date:||Jul-2010||Abstract:||In this paper we investigate the application of Tree-Adjunct Grammars to Grammatical Evolution. The standard type of grammar used by grammatical evolution, context-free grammars, produce a subset of the languages that tree-adjunct grammars can produce, making tree-adjunct grammars, expressively, more powerful. In this study we shed some light on the effects of tree-adjunct grammars in grammatical evolution, or Tree-Adjunct Grammatical Evolution. We perform an analytic comparison of the performance of both setups, i.e., grammatical evolution and tree-adjunct grammatical evolution, across a number of classic genetic programming benchmarking problems. The results firmly indicate that tree-adjunct grammatical evolution has a better overall performance (measured in terms of finding the global optima).||Funding Details:||Science Foundation Ireland||Type of material:||Conference Publication||Publisher:||IEEE||Copyright (published version):||2010 IEEE||Keywords:||Grammatical evolution;Tree adjunct grammar;Genetic programming;Evolutionary computation||Subject LCSH:||Genetic programming (Computer science)
|DOI:||10.1109/CEC.2010.5586497||Language:||en||Status of Item:||Peer reviewed||Is part of:||2010 IEEE Congress on Evolutionary Computation (CEC) [proceedings]||Conference Details:||Congress on Evolutionary Computation, IEEE World Congress on Computational Intelligence, Barcelona, Spain, 18-23 July|
|Appears in Collections:||Computer Science Research Collection|
CASL 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.