Scribd
Upload
85 views

Stochastic Universal Sampling

Stochastic universal sampling (SUS) is a technique used in genetic algorithms to select potential solutions for recombination in a way that reduces bias and spread. It uses a single random value to sample all solutions at evenly spaced intervals, giving weaker solutions a chance to be selected and reducing the unfair nature of fitness-proportional selection. Other selection methods can perform poorly when one solution has a much higher fitness than others. SUS starts from a small random number and chooses the next candidates from the remaining population, not allowing fittest members to dominate the selection. Pseudocode describes the SUS algorithm and its use of roulette wheel selection to implement fitness proportionate selection in a fairer way.

Uploaded by

princeram123
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
85 views

Stochastic Universal Sampling

Stochastic universal sampling (SUS) is a technique used in genetic algorithms to select potential solutions for recombination in a way that reduces bias and spread. It uses a single random value to sample all solutions at evenly spaced intervals, giving weaker solutions a chance to be selected and reducing the unfair nature of fitness-proportional selection. Other selection methods can perform poorly when one solution has a much higher fitness than others. SUS starts from a small random number and chooses the next candidates from the remaining population, not allowing fittest members to dominate the selection. Pseudocode describes the SUS algorithm and its use of roulette wheel selection to implement fitness proportionate selection in a fairer way.

Uploaded by

princeram123
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Stochastic universal sampling

From Wikipedia, the free encyclopedia

SUS example

Stochastic universal sampling (SUS) is a technique used in genetic algorithms for selecting potentially useful solutions for recombination. It was introduced by James Baker.[1] SUS is a development of fitness proportionate selection (FPS) which exhibits no bias and minimal spread. Where FPS chooses several solutions from the population by repeated random sampling, SUS uses a single random value to sample all of the solutions by choosing them at evenly spaced intervals. This gives weaker members of the population (according to their fitness) a chance to be chosen and thus reduces the unfair nature of fitness-proportional selection methods. Other methods like roulette wheel can have bad performance when a member of the population has a really large fitness in comparison with other members. Using a comb-like ruler, SUS starts from a small random number, and chooses the next candidates from the rest of population remaining, not allowing the fittest members to saturate the candidate space. Described as an algorithm, pseudocode for SUS looks like:

SUS(Population, N) F := total fitness of population N := number of offspring to keep P := distance between the pointers (F/N) Start := random number between 0 and P Pointers := [Start + i*P | i in [0..N-1]] return RWS(Population,Pointers) RWS(Population, Points) Keep = [] i := 0 for P in Points while fitness of Population[i] < P i++ add Population[i] to Keep

return Keep

Here RWS() describes the bulk of fitness proportionate selection (also known as "roulette wheel selection") - in true fitness proportional selection the parameter Points is always a (sorted) list of random numbers from 0 to F. The algorithm above is intended to be illustrative rather than canonical.

See also

You might also like