Using Compression to Understand the Distribution of
Building Blocks in Genetic Programming Populations
R. McKay, J. Shin, T. Hoang, X. Nguyen, and N. Mori. 2007 IEEE Congress on Evolutionary Computation, page 2501--2508. Singapore, IEEE Computational Intelligence Society, IEEE Press, (25-28 September 2007)
Abstract
Compression algorithms generate a predictive model of
data, using the model to reduce the number of bits
required to transmit the data (in effect, transmitting
only the differences from the model). As a consequence,
the degree of compression achieved provides an estimate
of the level of regularity in the data. Previous work
has investigated the use of these estimates to
understand the replication of building blocks within
Genetic Programming (GP) individuals, and hence to
understand how different GP algorithms promote the
evolution of repeated common structure within
individuals. Here, we extend this work to the
population level, and use it to understand the extent
of similarity between sub-structures within individuals
in GP populations.
%0 Conference Paper
%1 McKay:2007:CEC
%A McKay, Robert Ian (Bob)
%A Shin, Jungseok
%A Hoang, Tuan Hao
%A Nguyen, Xuan Hoai
%A Mori, Naoki
%B 2007 IEEE Congress on Evolutionary Computation
%C Singapore
%D 2007
%E Srinivasan, Dipti
%E Wang, Lipo
%I IEEE Press
%K algorithms, genetic programming
%P 2501--2508
%T Using Compression to Understand the Distribution of
Building Blocks in Genetic Programming Populations
%U http://sc.snu.ac.kr/PAPERS/cec07.pdf
%X Compression algorithms generate a predictive model of
data, using the model to reduce the number of bits
required to transmit the data (in effect, transmitting
only the differences from the model). As a consequence,
the degree of compression achieved provides an estimate
of the level of regularity in the data. Previous work
has investigated the use of these estimates to
understand the replication of building blocks within
Genetic Programming (GP) individuals, and hence to
understand how different GP algorithms promote the
evolution of repeated common structure within
individuals. Here, we extend this work to the
population level, and use it to understand the extent
of similarity between sub-structures within individuals
in GP populations.
%@ 1-4244-1340-0
@inproceedings{McKay:2007:CEC,
abstract = {Compression algorithms generate a predictive model of
data, using the model to reduce the number of bits
required to transmit the data (in effect, transmitting
only the differences from the model). As a consequence,
the degree of compression achieved provides an estimate
of the level of regularity in the data. Previous work
has investigated the use of these estimates to
understand the replication of building blocks within
Genetic Programming (GP) individuals, and hence to
understand how different GP algorithms promote the
evolution of repeated common structure within
individuals. Here, we extend this work to the
population level, and use it to understand the extent
of similarity between sub-structures within individuals
in GP populations.},
added-at = {2008-06-19T17:35:00.000+0200},
address = {Singapore},
author = {McKay, Robert Ian (Bob) and Shin, Jungseok and Hoang, Tuan Hao and Nguyen, Xuan Hoai and Mori, Naoki},
biburl = {https://www.bibsonomy.org/bibtex/2e19484d6cfa0480ac370ce37d2468971/brazovayeye},
booktitle = {2007 IEEE Congress on Evolutionary Computation},
editor = {Srinivasan, Dipti and Wang, Lipo},
file = {1917.pdf},
interhash = {b275b7f9be796553d691d4be7e530dbe},
intrahash = {e19484d6cfa0480ac370ce37d2468971},
isbn = {1-4244-1340-0},
keywords = {algorithms, genetic programming},
month = {25-28 September},
notes = {CEC 2007 - A joint meeting of the IEEE, the EPS, and
the IET.
IEEE Catalog Number: 07TH8963C},
organization = {IEEE Computational Intelligence Society},
pages = {2501--2508},
publisher = {IEEE Press},
timestamp = {2008-06-19T17:46:43.000+0200},
title = {Using Compression to Understand the Distribution of
Building Blocks in Genetic Programming Populations},
url = {http://sc.snu.ac.kr/PAPERS/cec07.pdf},
year = 2007
}