Coarse Graining Selection and Mutation | Zendy

Jonathan E. Rowe | Zendy; Michael D. Vose | Zendy; Alden H. Wright | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Coarse Graining Selection and Mutation

Author(s) -

Jonathan E. Rowe,

Michael D. Vose,

Alden H. Wright

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-27237-2

DOI - 10.1007/11513575_10

Subject(s) - granularity , selection (genetic algorithm) , computer science , mutation , context (archaeology) , population , binary number , differentiable function , ranking (information retrieval) , genetic algorithm , algorithm , mathematical optimization , mathematics , artificial intelligence , machine learning , pure mathematics , paleontology , demography , arithmetic , sociology , biology , gene , operating system , biochemistry , chemistry

Coarse graining is defined in terms of a commutative diagram. Necessary and sufficient conditions are given in the continuously differentiable case. The theory is applied to linear coarse grainings arising from partitioning the population space of a simple Genetic Algorithm (GA). Cases considered include proportional selection, binary tournament selection, and mutation. A nonlinear coarse graining for ranking selection is also presented. Within the context of GAs, the primary contribution made is the introduction and illustration of a technique by which the possibility for coarse grainings may be analyzed. A secondary contribution is that a number of new coarse graining results are obtained.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research