Evolving Graphs and Networks with Edge Encoding:
Preliminary Report
S. Luke, and L. Spector. Late Breaking Papers at the Genetic Programming 1996
Conference Stanford University July 28-31, 1996, page 117--124. Stanford University, CA, USA, Stanford Bookstore, (28--31 July 1996)
Abstract
We present an alternative to the cellular encoding
technique Gruau 1992 for evolving graph and network
structures via genetic programming. The new technique,
called edge encoding, uses edge operators rather than
the node operators of cellular encoding. While both
cellular encoding and edge encoding can produce all
possible graphs, the two encodings bias the genetic
search process in different ways; each may therefore be
most useful for a different set of problems. The
problems for which these techniques may be used, and
for which we think edge encoding may be particularly
useful, include the evolution of recurrent neural
networks, finite automata, and graph-based queries to
symbolic knowledge bases. In this preliminary report we
present a technical description of edge encoding and an
initial comparison to cellular encoding. Experimental
investigation of the relative merits of these encoding
schemes is currently in progress.
%0 Conference Paper
%1 luke:1996:egnee
%A Luke, Sean
%A Spector, Lee
%B Late Breaking Papers at the Genetic Programming 1996
Conference Stanford University July 28-31, 1996
%C Stanford University, CA, USA
%D 1996
%E Koza, John R.
%I Stanford Bookstore
%K algorithms, genetic programming
%P 117--124
%T Evolving Graphs and Networks with Edge Encoding:
Preliminary Report
%U http://citeseer.ist.psu.edu/412757.html
%X We present an alternative to the cellular encoding
technique Gruau 1992 for evolving graph and network
structures via genetic programming. The new technique,
called edge encoding, uses edge operators rather than
the node operators of cellular encoding. While both
cellular encoding and edge encoding can produce all
possible graphs, the two encodings bias the genetic
search process in different ways; each may therefore be
most useful for a different set of problems. The
problems for which these techniques may be used, and
for which we think edge encoding may be particularly
useful, include the evolution of recurrent neural
networks, finite automata, and graph-based queries to
symbolic knowledge bases. In this preliminary report we
present a technical description of edge encoding and an
initial comparison to cellular encoding. Experimental
investigation of the relative merits of these encoding
schemes is currently in progress.
%@ 0-18-201031-7
@inproceedings{luke:1996:egnee,
abstract = {We present an alternative to the cellular encoding
technique [Gruau 1992] for evolving graph and network
structures via genetic programming. The new technique,
called edge encoding, uses edge operators rather than
the node operators of cellular encoding. While both
cellular encoding and edge encoding can produce all
possible graphs, the two encodings bias the genetic
search process in different ways; each may therefore be
most useful for a different set of problems. The
problems for which these techniques may be used, and
for which we think edge encoding may be particularly
useful, include the evolution of recurrent neural
networks, finite automata, and graph-based queries to
symbolic knowledge bases. In this preliminary report we
present a technical description of edge encoding and an
initial comparison to cellular encoding. Experimental
investigation of the relative merits of these encoding
schemes is currently in progress.},
added-at = {2008-06-19T17:35:00.000+0200},
address = {Stanford University, CA, USA},
author = {Luke, Sean and Spector, Lee},
biburl = {https://www.bibsonomy.org/bibtex/2055d7dcc68c46b85ff4d5445f40f707f/brazovayeye},
booktitle = {Late Breaking Papers at the Genetic Programming 1996
Conference Stanford University July 28-31, 1996},
editor = {Koza, John R.},
interhash = {fa979de02bd530a9347612204a0e6860},
intrahash = {055d7dcc68c46b85ff4d5445f40f707f},
isbn = {0-18-201031-7},
keywords = {algorithms, genetic programming},
month = {28--31 July},
notes = {GP-96LB The email address for the bookstore for mail
orders is mailorder@bookstore.stanford.edu Phone no
415-329-1217 or 800-533-2670},
pages = {117--124},
publisher = {Stanford Bookstore},
publisher_address = {Stanford University, Stanford, California
94305-3079, USA},
timestamp = {2008-06-19T17:45:56.000+0200},
title = {Evolving Graphs and Networks with Edge Encoding:
Preliminary Report},
url = {http://citeseer.ist.psu.edu/412757.html},
year = 1996
}