An Investigation of Fitness Sharing in Genetic
Programming
R. McKay. The Australian Journal of Intelligent Information
Processing Systems, 7 (1/2):
43--51(July 2001)
Abstract
This paper investigates fitness sharing in genetic
programming. Implicit fitness sharing is applied to
populations of programs. Three treatments are compared:
raw fitness, pure fitness sharing, and a gradual change
from fitness sharing to raw fitness. The 6- and
11-multiplexer problems are compared. Using the same
population sizes, fitness sharing shows a large
improvement in the error rate for both problems.
Further experiments compare the treatments on learning
recursive list membership functions; again, there are
dramatic improvements in error rate. Conversely,
fitness sharing runs achieve comparable results to raw
fitness using populations two to three times smaller.
Measures of population diversity suggest that the
results are due to preservation of diversity and
avoidance of premature convergence by the fitness
sharing runs.
%0 Journal Article
%1 McKay:2001:AJIIPS_1
%A McKay, R. I. (Bob)
%D 2001
%J The Australian Journal of Intelligent Information
Processing Systems
%K algorithms, genetic programming
%N 1/2
%P 43--51
%T An Investigation of Fitness Sharing in Genetic
Programming
%U http://sc.snu.ac.kr/PAPERS/AJIIPSfitshr.pdf
%V 7
%X This paper investigates fitness sharing in genetic
programming. Implicit fitness sharing is applied to
populations of programs. Three treatments are compared:
raw fitness, pure fitness sharing, and a gradual change
from fitness sharing to raw fitness. The 6- and
11-multiplexer problems are compared. Using the same
population sizes, fitness sharing shows a large
improvement in the error rate for both problems.
Further experiments compare the treatments on learning
recursive list membership functions; again, there are
dramatic improvements in error rate. Conversely,
fitness sharing runs achieve comparable results to raw
fitness using populations two to three times smaller.
Measures of population diversity suggest that the
results are due to preservation of diversity and
avoidance of premature convergence by the fitness
sharing runs.
@article{McKay:2001:AJIIPS_1,
abstract = {This paper investigates fitness sharing in genetic
programming. Implicit fitness sharing is applied to
populations of programs. Three treatments are compared:
raw fitness, pure fitness sharing, and a gradual change
from fitness sharing to raw fitness. The 6- and
11-multiplexer problems are compared. Using the same
population sizes, fitness sharing shows a large
improvement in the error rate for both problems.
Further experiments compare the treatments on learning
recursive list membership functions; again, there are
dramatic improvements in error rate. Conversely,
fitness sharing runs achieve comparable results to raw
fitness using populations two to three times smaller.
Measures of population diversity suggest that the
results are due to preservation of diversity and
avoidance of premature convergence by the fitness
sharing runs.},
added-at = {2008-06-19T17:35:00.000+0200},
author = {McKay, R. I. (Bob)},
biburl = {https://www.bibsonomy.org/bibtex/291bbe814ba6a0131f8fc41f8f0f0324b/brazovayeye},
interhash = {4c88dfb61a85bd4937f33e78f337ed64},
intrahash = {91bbe814ba6a0131f8fc41f8f0f0324b},
journal = {The Australian Journal of Intelligent Information
Processing Systems},
keywords = {algorithms, genetic programming},
month = {July},
number = {1/2},
pages = {43--51},
size = {8 pages},
timestamp = {2008-06-19T17:46:40.000+0200},
title = {An Investigation of Fitness Sharing in Genetic
Programming},
url = {http://sc.snu.ac.kr/PAPERS/AJIIPSfitshr.pdf},
volume = 7,
year = 2001
}