ACM Home Page
Please provide us with feedback. Feedback
A common genetic encoding for both direct and indirect encodings of networks
Full text PdfPdf (253 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 9th annual conference on Genetic and evolutionary computation table of contents
London, England
SESSION: Generative and developmental systems: papers table of contents
Pages: 1029 - 1036  
Year of Publication: 2007
ISBN:978-1-59593-697-4
Authors
Yohannes Kassahun  University of Bremen, Bremen, Germany
Mark Edgington  University of Bremen, Bremen, Germany
Jan Hendrik Metzen  University of Bremen, Bremen, Germany
Gerald Sommer  Christian Albrechts University, Kiel, Germany
Frank Kirchner  University of Bremen: German Research Center for Artificial Intelligence (DFKI), Bremen, Germany
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 61,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1276958.1277162
What is a DOI?

ABSTRACT

In this paper we present a Common Genetic Encoding (CGE) for networks that can be applied to both direct and indirect encoding methods. As a direct encoding method, CGE allows the implicit evaluation of an encoded phenotype without the need to decode the phenotype from the genotype. On the other hand, one can easily decode the structure of a phenotype network, since its topology is implicitly encoded in the genotype's gene-order. Furthermore, we illustrate how CGE can be used for the indirect encoding of networks. CGE has useful properties that makes it suitable for evolving neural networks. A formal definition of the encoding is given, and some of the important properties of the encoding are proven such as its closure under mutation operators, its completeness in representing any phenotype network, and the existence of an algorithm that can evaluate any given phenotype without running into an infinite loop.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
P. J. Angeline, G. M. Saunders, and J. B. Pollack. An evolutionary algorithm that constructs recurrent neural networks. IEEE Transactions on Neural Networks, 5:54--65, 1994.
 
2
F. Gomez, J. Schmidhuber, and R. Miikkulainen. Efficient non-linear control through neuroevolution. In Proceedings of the European Conference on Machine Learning (ECML 2006), 2006.
 
3
F. Gruau. Neural Network Synthesis Using Cellular Encoding and the Genetic Algorithm. PhD thesis, Ecole Normale Superieure de Lyon, Laboratoire de l'Informatique du Parallelisme, France, January 1994.
 
4
Y. Kassahun. Towards a Unified Approach to Learning and Adaptation. PhD thesis, Technical Report 0602, Institute of Computer Science and Applied Mathematics, Christian-Albrechts University, Kiel, Germany, February 2006.
 
5
S. Luke and L. Spector. Evolving graphs and networks with edge encoding: Preliminary report. In Late-breaking papers of Genetic Programming 1996. Stanford, CA, 1996.
 
6
 
7
J. Reisinger, K. O. Stanley, and R. Miikkulainen. Evolving reusable neural modules. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2004), pages 69--81, 2004.
 
8
9
 
10
X. Yao. Evolving artificial neural networks. Proceedings of the IEEE, 87(9):1423--1447, 1999.


Collaborative Colleagues:
Yohannes Kassahun: colleagues
Mark Edgington: colleagues
Jan Hendrik Metzen: colleagues
Gerald Sommer: colleagues
Frank Kirchner: colleagues