The automatic generation of programs for classification problems with grammatical swarm

Michael O'Neill, Anthony Brabazon, Catherine Adley

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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, the first a mushroom classification problem, the second a bioinformatics problem that involves the detection of eukaryotic DNA promoter sequences. For the first problem we generate solutions that take the form of conditional statements in a C-Iike 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.

Original languageEnglish
Title of host publicationProceedings of the 2004 Congress on Evolutionary Computation, CEC2004
Pages104-110
Number of pages7
Publication statusPublished - 2004
EventProceedings of the 2004 Congress on Evolutionary Computation, CEC2004 - Portland, OR, United States
Duration: 19 Jun 200423 Jun 2004

Publication series

NameProceedings of the 2004 Congress on Evolutionary Computation, CEC2004
Volume1

Conference

ConferenceProceedings of the 2004 Congress on Evolutionary Computation, CEC2004
Country/TerritoryUnited States
CityPortland, OR
Period19/06/0423/06/04

Fingerprint

Dive into the research topics of 'The automatic generation of programs for classification problems with grammatical swarm'. Together they form a unique fingerprint.

Cite this