Changes between Version 7 and Version 8 of Documentation/Reference/Genetic Programming Crossovers
- Timestamp:
- 07/23/14 17:38:21 (10 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
Documentation/Reference/Genetic Programming Crossovers
v7 v8 17 17 - The behavioral distances between node ''i'' and every node ''j'' from `parent1` are computed using a formula that takes into account the minimum and maximum values computed by the two nodes during evaluation: 18 18 19 [[Image( http://dev.heuristiclab.com/trac/hl/core/raw-attachment/wiki/Crossovers/01-PFX-behavioral-distance.png)]]19 [[Image(01-PFX-behavioral-distance.png)]] 20 20 21 21 - Once all the behavioral distances between node ''i'' and every node ''j'' have been calculated, they are normalized: 22 22 23 [[Image( http://dev.heuristiclab.com/trac/hl/core/raw-attachment/wiki/Crossovers/02-PFX-normalized-behavioral-distance.png)]]23 [[Image(02-PFX-normalized-behavioral-distance.png)]] 24 24 25 25 and turned into selection probabilities (weights): 26 26 27 [[Image( http://dev.heuristiclab.com/trac/hl/core/raw-attachment/wiki/Crossovers/03-PFX-selection-probabilities.png)]]27 [[Image(03-PFX-selection-probabilities.png)]] 28 28 29 29 - A node from the second parent is probabilistically chosen and swapped with node ''i'' from the first parent … … 36 36 - The sampling semantic distance (SSD) between two nodes (subtrees) is defined as the absolute mean between their corresponding sampling semantics: 37 37 38 [[Image( http://dev.heuristiclab.com/trac/hl/core/raw-attachment/wiki/Crossovers/04-SSX-sampling-semantic-distance.png)]]38 [[Image(04-SSX-sampling-semantic-distance.png)]] 39 39 40 40 where S1 and S2 are the two subtrees, and ''U'', ''V'' are their respective sampling semantics. 41 41 - Two nodes are deemed similar if their SSD falls within a predefined interval [alfa,beta]: 42 42 43 [[Image( http://dev.heuristiclab.com/trac/hl/core/raw-attachment/wiki/Crossovers/05-SSX-similarity-condition.png)]]43 [[Image(05-SSX-similarity-condition.png)]] 44 44 45 45 The crossover procedure chooses a crossover point from `parent0`, then picks the first node in `parent1` that satisfies the similarity condition (5).