Lecture Notes in Computer Science
DOI: 10.1007/978-3-540-71605-1_6
|View full text |Cite
|
Sign up to set email alerts
|

Empirical Analysis of GP Tree-Fragments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
11
0

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(12 citation statements)
references
References 6 publications
1
11
0
Order By: Relevance
“…An alternative way to tackle the huge number of schemata processed by GP proposed by Smart et al is to consider so called maximal fragments [61]. In the authors notation a fragment closely resembles Langdon-style [44] i.e.…”
Section: Offline Methodsmentioning
confidence: 99%
“…An alternative way to tackle the huge number of schemata processed by GP proposed by Smart et al is to consider so called maximal fragments [61]. In the authors notation a fragment closely resembles Langdon-style [44] i.e.…”
Section: Offline Methodsmentioning
confidence: 99%
“…Majeed [20] extracted schemata as subtrees with acceptable sizes that occur in at least half of the population and present in the last generation. Smart and Zhang [17] also studied the number and size of fragments in population, the popularity of most frequent fragment and the number of "maximal fragments" over different generations. Some other researchers tried to employ schema theory for improving the GP performance [7,8,34].…”
Section: Related Workmentioning
confidence: 98%
“…Thus, all of previously mentioned schema theories suffer from issues enumerated in Section 1. Except in very few researches [17,20,25], no extraction method is specified for finding the present schemata in a given population by studies of Table 1. Again, it is indicated in the table that researchers rarely provided experimental results for their schema theories.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations