Using loops in genetic programming for a two class binary image classification problem

Authors:
Xiang Li;Vic Ciesielski
Affiliations:
School of Computer Science and Information Technology, RMIT University, Melbourne, Victoria;School of Computer Science and Information Technology, RMIT University, Melbourne, Victoria
Venue:
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
Year:
2004

Citing 8
Cited 1

Genetic programming II: automatic discovery of reusable programs

Genetic programming II: automatic discovery of reusable programs
Type inheritance in strongly typed genetic programming

Advances in genetic programming
Data structures and genetic programming

Advances in genetic programming
Genetic Programming III: Darwinian Invention & Problem Solving

Genetic Programming III: Darwinian Invention & Problem Solving
Generality and Difficulty in Genetic Programming: Evolving a Sort

Proceedings of the 5th International Conference on Genetic Algorithms
Genetic Programming for Multiple Class Object Detection

AI '99 Proceedings of the 12th Australian Joint Conference on Artificial Intelligence: Advanced Topics in Artificial Intelligence
Hyperspectral Image Analysis Using Genetic Programming

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Fitness Causes Bloat: Mutation

EuroGP '98 Proceedings of the First European Workshop on Genetic Programming

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

SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Loops are rarely used in genetic programming (GP), because they lead to massive computation due to the increase in the size of the search space We have investigated the use of loops with restricted semantics for a problem in which there are natural repetitive elements, that of distinguishing two classes of images Using our formulation, programs with loops were successfully evolved and performed much better than programs without loops Our results suggest that loops can successfully used in genetic programming in situations where domain knowledge is available to provide some restrictions on loop semantics.