Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/2832
Title: | Reducing bloat in genetic programming | Authors: | MONSIEURS, Patrick FLERACKERS, Eddy |
Issue Date: | 2001 | Publisher: | SPRINGER-VERLAG BERLIN | Source: | Computational Intelligence. Theory and Applications. p. 471-478 | Series/Report: | LECTURE NOTES IN COMPUTER SCIENCE | Series/Report no.: | 2206 | Abstract: | In this paper, several techniques will be presented to constrain the growth of solutions that are constructed by genetic programming. The most successful technique imposes a maximum size on the created individuals of the population that depends solely on the size of the best individual of the population. This method will be compared with other methods to reduce bloat, demonstrating that this method reduces bloat significantly better than the other methods. | Notes: | Expertise Ctr Digital Media, B-3590 Diepenbeek, Belgium.Monsieurs, P, Expertise Ctr Digital Media, Wetenschapspk 2, B-3590 Diepenbeek, Belgium.patrick.monsieurs@luc.ac.be eddy.flerackers@luc.ac.be | Document URI: | http://hdl.handle.net/1942/2832 | ISSN: | 0302-9743 | DOI: | 10.1007/3-540-45493-4_48 | ISI #: | 000237080600048 | Category: | A1 | Type: | Journal Contribution | Validations: | ecoom 2007 |
Appears in Collections: | Research publications |
Show full item record
SCOPUSTM
Citations
5
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
4
checked on Oct 14, 2024
Page view(s)
74
checked on Nov 7, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.