Abstract
An artificial neural network with all its elements is a rather complex structure, not easily constructed and/or trained to perform a particular task. Consequently, several researchers used genetic algorithms to evolve partial aspects of neural networks, such as the weights, the thresholds, and the network architecture. Indeed, over the last decade many systems have been developed that perform total network induction. In this work it is shown how the chromosomes of Gene Expression Programming can be modified so that a complete neural network, including the architecture, the weights and thresholds, could be totally encoded in a linear chromosome. It is also shown how this chromosomal organization allows the training/adaptation of the network using the evolutionary mechanisms of selection and modification, thus providing an approach to the automatic design of neural networks. The workings and performance of this new algorithm are tested on the 6-multiplexer and on the classical exclusive-or problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anderson, J. A. (1995), An Introduction to Neural Networks, MIT Press.
Angeline, P. J., G. M. Saunders, and J. B. Pollack (1993). “An evolutionary algorithm that constructs recurrent neural networks,” IEEE Transactions on Neural Networks, 5: 54–65.
Braun, H. and J. Weisbrod (1993), “Evolving feedforward neural networks,” In Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms, Innsbruck, Springer-Verlag.
Dasgupta, D. and D. McGregor (1992), “Designing application-specific neural networks using the structured genetic algorithm,” In Proceedings of the International Conference on Combinations of Genetic Algorithms and Artificial Neural Networks, pp. 87–96.
Ferreira, C. (2001), “Gene expression programming: A new adaptive algorithm for solving problems,” Complex Systems, 13 (2): 87–129.
Ferreira, C. (2002), “Genetic representation and genetic neutrality in gene expression programming,” Advances in Complex Systems, 5 (4): 389–408.
Ferreira, C. (2003), “Function finding and the creation of numerical constants in gene expression programming,” In J. M. Benitez, O. Cordon, F. Hoffmann, and R. Roy, eds, Advances in Soft Computing: Engineering Design and Manufacturing, pp. 257–266, Springer-Verlag.
Gruau, F., D. Whitley, and L. Pyeatt (1996), “A comparison between cellular encoding and direct encoding for genetic neural networks,” In J. R. Koza, D. E. Goldberg, D. B. Fogel, and R. L. Riolo, eds, Genetic Programming: Proceedings of the First Annual Conference, pp. 81–89, Cambridge, MA, MIT Press.
Koza, J. R. and J. P. Rice (1991), “Genetic generation of both the weights and architecture for a neural network,” In Proceedings of the International Joint Conference on Neural Networks, Volume II, IEEE Press.
Lee, C.-H. and J.-H. Kim (1996), “Evolutionary ordered neural network with a linked-list encoding scheme,” In Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, pp. 665–669.
Mandischer, M. (1993), “Representation and evolution of neural networks,” In R. F. Albrecht, C. R. Reeves, and U. C. Steele, eds, Artificial Neural Nets and Genetic Algorithms, pp. 643–649, Springer Verlag.
Maniezzo, V. (1994), “Genetic evolution of the topology and weight distribution of neural networks,” IEEE Transactions on Neural Networks, 5 (1): 39–53.
Opitz, D. W. and J. W. Shavlik (1997), “Connectionist theory refinement: Genetically searching the space of network topologies,” Journal of Artificial Intelligence Research, 6: 177–209.
Pujol, J. C. F. and R. Poli (1998), “Evolving the topology and the weights of neural networks using a dual representation,” Applied Intelligence Journal, Special Issue on Evolutionary Learning, 8(1): 73–84.
Yao, X. and Y. Liu (1996), “Towards designing artificial neural networks by evolution,” Applied Mathematics and Computation, 91(1): 83–90.
Zhang, B.-T. and H. Muhlenbein (1993), “Evolving optimal neural networks using genetic algorithms with Occam’s razor,” Complex Systems, 7: 199–220.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this paper
Cite this paper
Ferreira, C. (2006). Designing Neural Networks Using Gene Expression Programming. In: Abraham, A., de Baets, B., Köppen, M., Nickolay, B. (eds) Applied Soft Computing Technologies: The Challenge of Complexity. Advances in Soft Computing, vol 34. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-31662-0_40
Download citation
DOI: https://doi.org/10.1007/3-540-31662-0_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31649-7
Online ISBN: 978-3-540-31662-6
eBook Packages: EngineeringEngineering (R0)