2008
DOI: 10.1017/s0004972708000233
|View full text |Cite
|
Sign up to set email alerts
|

Higher Epistasis in Genetic Algorithms

Abstract: We study the k-epistasis of a fitness function over a search space. This concept is a natural generalization of that of epistasis, previously considered by Davidor, Suys We completely characterize fitness functions whose k-epistasis is minimal: these are exactly the functions of order k. We also obtain an upper bound for the k-epistasis of nonnegative fitness functions.2000 Mathematics subject classification: 68R99.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2011
2011
2013
2013

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 4 publications
0
2
0
Order By: Relevance
“…The generalisation of this concept to A;-epistasis (k € N) can be found in [8]. The general case is much more technical, so we preferred to stick to the more intuitive case k = 2, in the present note.…”
Section: Fia»i>»k)-(t-2) E /Fw-mentioning
confidence: 99%
“…The generalisation of this concept to A;-epistasis (k € N) can be found in [8]. The general case is much more technical, so we preferred to stick to the more intuitive case k = 2, in the present note.…”
Section: Fia»i>»k)-(t-2) E /Fw-mentioning
confidence: 99%
“…The resulting models include genetic programming [8], Random Forests [9], neural networks [10], Bayesian Networks [11], [12], [13], greedy search [14], information theoretical approaches [15] and Multifactor Dimensionality Reduction (MDR) [16].…”
Section: Introductionmentioning
confidence: 99%