Title
Coarse-graining in genetic algorithms: some issues and examples
Abstract
Following the work of Stephens and coworkers on the coarse-grained dynamics of genetic systems, we work towards a possible generalisation in the context of genetic algorithms, giving as examples schemata, genotype-phenotype mappings, and error classes in the Eigen model. We discuss how the dynamics transforms under a coarse-graining, comparing and contrasting different notions of invariance. We work out some examples in the two-bit case, to illustrate the ideas and issues.We then find a bound for the SelectionWeighted Linkage Disequilibrium Coefficient for the two-bit onemax problem.
Year
DOI
Venue
2003
10.1007/3-540-45105-6_100
GECCO
Keywords
Field
DocType
error class,different notion,coarse-grained dynamic,eigen model,genetic algorithm,selectionweighted linkage disequilibrium coefficient,examples schema,two-bit onemax problem,genetic system,two-bit case,genetics
Mathematical optimization,Invariant (physics),Binary strings,Computer science,Generalization,Theoretical computer science,Artificial intelligence,Granularity,Schema (psychology),Machine learning,Genetic algorithm
Conference
Volume
ISSN
ISBN
2723
0302-9743
3-540-40602-6
Citations 
PageRank 
References 
5
0.67
2
Authors
3
Name
Order
Citations
PageRank
Andrés Aguilar Contreras150.67
Jonathan E. Rowe245856.35
Christopher R Stephens312219.10