The Automatic Generation of Programs for
Classification Problems with Grammatical Swarm
M. O'Neill, A. Brabazon, and C. Adley. Proceedings of the 2004 IEEE Congress on Evolutionary
Computation, page 104--110. Portland, Oregon, IEEE Press, (20-23 June 2004)
Abstract
This case study examines the application of
Grammatical Swarm to classification problems, and
illustrates the Particle Swarm algorithms' ability to
specify the construction of programs. Each individual
particle represents choices of program construction
rules, where these rules are specified using a
Backus-Naur Form grammar. Two problem instances are
tackled, for the first problem we generate solutions
that take the form of conditional statements in a
C-like language subset, and for the second problem we
generate simple regular expressions. The results
demonstrate that it is possible to generate programs
using the Grammatical Swarm technique with a
performance similar to the Grammatical Evolution
evolutionary automatic programming approach.
%0 Conference Paper
%1 oneill:2004:tagopfcpwgs
%A O'Neill, Michael
%A Brabazon, Anthony
%A Adley, Catherine
%B Proceedings of the 2004 IEEE Congress on Evolutionary
Computation
%C Portland, Oregon
%D 2004
%I IEEE Press
%K Intelligence, Swarm algorithms, evolution genetic gramatical programming,
%P 104--110
%T The Automatic Generation of Programs for
Classification Problems with Grammatical Swarm
%X This case study examines the application of
Grammatical Swarm to classification problems, and
illustrates the Particle Swarm algorithms' ability to
specify the construction of programs. Each individual
particle represents choices of program construction
rules, where these rules are specified using a
Backus-Naur Form grammar. Two problem instances are
tackled, for the first problem we generate solutions
that take the form of conditional statements in a
C-like language subset, and for the second problem we
generate simple regular expressions. The results
demonstrate that it is possible to generate programs
using the Grammatical Swarm technique with a
performance similar to the Grammatical Evolution
evolutionary automatic programming approach.
%@ 0-7803-8515-2
@inproceedings{oneill:2004:tagopfcpwgs,
abstract = {This case study examines the application of
Grammatical Swarm to classification problems, and
illustrates the Particle Swarm algorithms' ability to
specify the construction of programs. Each individual
particle represents choices of program construction
rules, where these rules are specified using a
Backus-Naur Form grammar. Two problem instances are
tackled, for the first problem we generate solutions
that take the form of conditional statements in a
C-like language subset, and for the second problem we
generate simple regular expressions. The results
demonstrate that it is possible to generate programs
using the Grammatical Swarm technique with a
performance similar to the Grammatical Evolution
evolutionary automatic programming approach.},
added-at = {2008-06-19T17:46:40.000+0200},
address = {Portland, Oregon},
author = {O'Neill, Michael and Brabazon, Anthony and Adley, Catherine},
biburl = {https://www.bibsonomy.org/bibtex/2cffe975160127f08c5f1f9fb33f0ef1c/brazovayeye},
booktitle = {Proceedings of the 2004 IEEE Congress on Evolutionary
Computation},
interhash = {699e28ae69231fea8c294e99dfcdbd3d},
intrahash = {cffe975160127f08c5f1f9fb33f0ef1c},
isbn = {0-7803-8515-2},
keywords = {Intelligence, Swarm algorithms, evolution genetic gramatical programming,},
month = {20-23 June},
notes = {CEC 2004 - A joint meeting of the IEEE, the EPS, and
the IEE.},
pages = {104--110},
publisher = {IEEE Press},
timestamp = {2008-06-19T17:48:59.000+0200},
title = {The Automatic Generation of Programs for
Classification Problems with Grammatical Swarm},
year = 2004
}