Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a21ae88b0f5a52f1

Jump to content

// Workers AI · dad joke modeWhat did truncation selection say? "I cut ties.

From Wikipedia, the free encyclopedia

Truncation selection is a selection method in selective breeding and in evolutionary algorithms from computer science, which selects a certain share of fittest individuals from a population for reproduction in the next generation.

Animal and plant breeding

[edit]

In animal and plant breeding, truncation selection is a standard method. Animals are ranked by their phenotypic value on some trait such as milk production, and the top percentage is reproduced. The effects of truncation selection for a continuous trait can be modeled by the standard breeder's equation by using heritability and truncated normal distributions. On a binary trait, it can be modeled easily using the liability threshold model. It is considered an easy and efficient method of breeding.[1]

Computer science

[edit]

In computer science, truncation selection is a selection method used in evolutionary algorithms to select potential candidate solutions for recombination modeled after the breeding method.[2] In truncation selection the candidate solutions are ordered by fitness, and some proportion T% of the top fittest individuals are selected and reproduced randomly. It is used in Muhlenbein's breeder genetic algorithm.[3]

References

[edit]
  1. Crow & Kimura 1979, "Efficiency of truncation selection"
  2. Blickle, Tobias; Thiele, Lothar (December 1996). "A Comparison of Selection Schemes Used in Evolutionary Algorithms". Evolutionary Computation. 4 (4): 361–394. doi:10.1162/evco.1996.4.4.361.
  3. H Muhlenbein, D Schlierkamp-Voosen (1993). "Predictive Models for the Breeder Genetic Algorithm". Evolutionary Computation. doi:10.1162/evco.1993.1.1.25. S2CID 16085506.
[edit]