2005 IEEE Congress on Evolutionary Computation
DOI: 10.1109/cec.2005.1554822
|View full text |Cite
|
Sign up to set email alerts
|

Linear Genetic Programming using a compressed genotype representation

Abstract: Abstract-This paper presents a modularization strategy for linear genetic programming (GP) based on a substring compression/substitution scheme. The purpose of this substitution scheme is to protect building blocks and is in other words a form of learning linkage. The compression of the genotype provides both a protection mechanism and a form of genetic code reuse. This paper presents results for synthetic genetic algorithm (GA) reference problems like SEQ and OneMax as well as several standard GP problems. Th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 9 publications
0
4
0
Order By: Relevance
“…Representation: In most of the approaches, GP individuals are represented as a tree structure. Moreover, the linear representation for GP, which is also constructed using functions and terminals, is employed in a few works 37 …”
Section: Terminologies Used In Gpmentioning
confidence: 99%
See 3 more Smart Citations
“…Representation: In most of the approaches, GP individuals are represented as a tree structure. Moreover, the linear representation for GP, which is also constructed using functions and terminals, is employed in a few works 37 …”
Section: Terminologies Used In Gpmentioning
confidence: 99%
“…In another technique, Parent et al 37 proposed lossless compression of medical images. They used a linear GP driven by compressed GA (cGA) and found a transformation, represented as T ( d ), which improved the compression ratio of data d .…”
Section: Category‐wise Image Processing Applications Of Gpmentioning
confidence: 99%
See 2 more Smart Citations