Abstract
An arbitrary neural network has a number of functionally equivalent other networks. This causes redundancy in genetic representation of neural networks, which considerably undermines the merit of crossover in GAs [1]. This problem has received considerable attention in the past and has also been called the “competing conventions” problem [2].
We transform each neural network to an isomorphic neural network to maximize the genotypic consistency of two parents. We aim to develop a better genetic algorithm for neural network optimization by helping crossover preserve common functional characteristics of the two parents. This is achieved by protecting “phenotypic” consistency and, consequently, preserving building blocks with promising schemata.
This work was supported by Brain Korea 21 Project. The ICT at Seoul National University provided research facilities for this study.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Schaffer, J.D., Whitley, D., Eshelman, L.J.: Combinations of genetic algorithms and neural networks: A survey of the state of the art. In: International Workshop on Combinations of Genetic Algorithms and Neural Networks, pp. 1–37 (1992)
Thierens, D.: Non-redundant genetic coding of neural networks. In: IEEE International Conference on Evolutionary Computation, pp. 571–575 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, JH., Choi, SS., Moon, BR. (2004). Neural Network Normalization for Genetic Search. In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24855-2_42
Download citation
DOI: https://doi.org/10.1007/978-3-540-24855-2_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22343-6
Online ISBN: 978-3-540-24855-2
eBook Packages: Springer Book Archive