Structured genetic algorithm representations for neural network evolution

Authors:
Angelos Molfetas;George Bryan
Affiliations:
School of Computing and Mathematics, University of Western Sydney, Penrith South DC, NSW, Australia;School of Computing and Mathematics, University of Western Sydney, Penrith South DC, NSW, Australia
Venue:
AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
Year:
2007

Citing 5
Cited 0

Evolving neural networks

Biological Cybernetics
An Introduction to Genetic Algorithms

An Introduction to Genetic Algorithms
Evolving Neuro-Controllers for a Dynamic System Using Structured Genetic Algorithms

Applied Intelligence
Alternative Neural Network Training Methods

IEEE Expert: Intelligent Systems and Their Applications
Investigating the effect of incorporating additional levels in structured genetic algorithms

AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Evolutionary Algorithms used to generate Artificial Neural Networks have relied on both binary and real value representation approaches to encode connection weights in the chromosomes. This paper documents a study which examined how the utilisation of these two approaches affects the convergence of the Structured Genetic Algorithm when used to evolve Artificial Neural Networks. This study found that Structured Genetic Algorithms exhibited better performance when they utilised a real valued approach to encode the weights, especially when multiple control levels were utilised. Structured Genetic Algorithms which used real number encoding for the weights in their parametric level attained reduced training and testing errors. A reduction in the duration of the SGA simulations was also observed, though this diminished with each added control level. In contrast to this, Genetic Algorithms performed better with the binary encoding approach.