Parameterised Indexed FOR-Loops in Genetic Programming and Regular Binary Pattern Strings

Authors:
Gayan Wijesinghe;Vic Ciesielski
Affiliations:
School of Computer Science and Information Technology, RMIT University, Melbourne, Australia 3001;School of Computer Science and Information Technology, RMIT University, Melbourne, Australia 3001
Venue:
SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
Year:
2008

Citing 6
Cited 0

Data structures and genetic programming

Advances in genetic programming
Using genetic programming for the induction of novice procedural programming solution algorithms

Proceedings of the 2002 ACM symposium on Applied computing
Genetic Programming III: Darwinian Invention & Problem Solving

Genetic Programming III: Darwinian Invention & Problem Solving
Experiments with indexed FOR-loops in genetic programming

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Evolving while-loop structures in genetic programming for factorial and ant problems

AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Using loops in genetic programming for a two class binary image classification problem

AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present two methods to represent and use parameterised indexed FOR-loops in genetic programming. They are tested on learning the repetitive unit of regular binary pattern strings to reproduce these patterns to user specified arbitrary lengths. Particularly, we investigate the effectiveness of low-level and high-level functions inside these loops for the accuracy and the semantic efficiency of solutions. We used 5 test cases at increasing difficulty levels and our results show the high-level approach producing solutions in at least 19% of the runs when the low-level approach struggled to produce any in most cases.