Browse Wiki & Semantic Web

Jump to: navigation, search
Http://dbpedia.org/resource/Stochastic universal sampling
  This page has no properties.
hide properties that link here 
  No properties link to this page.
 
http://dbpedia.org/resource/Stochastic_universal_sampling
http://dbpedia.org/ontology/abstract Mètode de selecció proporcional a l'aptituMètode de selecció proporcional a l'aptitud, proposat com a millora del mètode de Selecció de la ruleta Va ser proposat per Booker i Brindle com una alternativa per aproximar-se més als valors de còpies esperats per individu. Assigna determinísticament les parts senceres dels valors esperats per a cada individu i després utilitza un altre esquema (proporcional) per a la part fraccionària. Això redueix els problemes de la ruleta, però pot dur a la convergència prematura. però pot dur a la convergència prematura. , Stochastic universal sampling (SUS) is a tStochastic universal sampling (SUS) is a technique used in genetic algorithms for selecting potentially useful solutions for recombination. It was introduced by James Baker. 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. FPS 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 = [] for P in Points I := 0 while fitness sum of Population[0..I] < P I++ add Population[I] to Keep return Keep Where <i>Population</i>[<i>0</i>..<i>I</i>] is the set of individuals with array-index 0 to (and including) I. 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. to be illustrative rather than canonical.
http://dbpedia.org/ontology/thumbnail http://commons.wikimedia.org/wiki/Special:FilePath/Statistically_Uniform.png?width=300 +
http://dbpedia.org/ontology/wikiPageID 8885706
http://dbpedia.org/ontology/wikiPageLength 2629
http://dbpedia.org/ontology/wikiPageRevisionID 1031033736
http://dbpedia.org/ontology/wikiPageWikiLink http://dbpedia.org/resource/File:Statistically_Uniform.png + , http://dbpedia.org/resource/Category:Genetic_algorithms + , http://dbpedia.org/resource/Genetic_algorithm + , http://dbpedia.org/resource/Reward-based_selection + , http://dbpedia.org/resource/Roulette_wheel_selection + , http://dbpedia.org/resource/Fitness_proportionate_selection +
http://dbpedia.org/property/wikiPageUsesTemplate http://dbpedia.org/resource/Template:Mono +
http://purl.org/dc/terms/subject http://dbpedia.org/resource/Category:Genetic_algorithms +
http://purl.org/linguistics/gold/hypernym http://dbpedia.org/resource/Technique +
http://www.w3.org/ns/prov#wasDerivedFrom http://en.wikipedia.org/wiki/Stochastic_universal_sampling?oldid=1031033736&ns=0 +
http://xmlns.com/foaf/0.1/depiction http://commons.wikimedia.org/wiki/Special:FilePath/Statistically_Uniform.png +
http://xmlns.com/foaf/0.1/isPrimaryTopicOf http://en.wikipedia.org/wiki/Stochastic_universal_sampling +
owl:sameAs http://bg.dbpedia.org/resource/%D0%A1%D1%82%D0%BE%D1%85%D0%B0%D1%81%D1%82%D0%B8%D1%87%D0%BD%D0%BE_%D1%83%D0%BD%D0%B8%D0%B2%D0%B5%D1%80%D1%81%D0%B0%D0%BB%D0%BD%D0%BE_%D1%81%D0%B5%D0%BC%D0%BF%D0%BB%D0%B8%D1%80%D0%B0%D0%BD%D0%B5 + , http://dbpedia.org/resource/Stochastic_universal_sampling + , http://rdf.freebase.com/ns/m.027n960 + , https://global.dbpedia.org/id/EvK6 + , http://www.wikidata.org/entity/Q11949983 + , http://ca.dbpedia.org/resource/Sobrant_Estoc%C3%A0stic_%28algorisme_gen%C3%A8tic%29 + , http://yago-knowledge.org/resource/Stochastic_universal_sampling +
rdf:type http://dbpedia.org/class/yago/PsychologicalFeature100023100 + , http://dbpedia.org/class/yago/WikicatStochasticAlgorithms + , http://dbpedia.org/class/yago/YagoPermanentlyLocatedEntity + , http://dbpedia.org/class/yago/Rule105846932 + , http://dbpedia.org/ontology/TopicalConcept + , http://dbpedia.org/class/yago/Procedure101023820 + , http://dbpedia.org/class/yago/Algorithm105847438 + , http://dbpedia.org/class/yago/Abstraction100002137 + , http://dbpedia.org/class/yago/Activity100407535 + , http://dbpedia.org/class/yago/Act100030358 + , http://dbpedia.org/class/yago/Event100029378 + , http://dbpedia.org/class/yago/WikicatGeneticAlgorithms +
rdfs:comment Mètode de selecció proporcional a l'aptituMètode de selecció proporcional a l'aptitud, proposat com a millora del mètode de Selecció de la ruleta Va ser proposat per Booker i Brindle com una alternativa per aproximar-se més als valors de còpies esperats per individu. Assigna determinísticament les parts senceres dels valors esperats per a cada individu i després utilitza un altre esquema (proporcional) per a la part fraccionària. Això redueix els problemes de la ruleta, però pot dur a la convergència prematura. però pot dur a la convergència prematura. , Stochastic universal sampling (SUS) is a tStochastic universal sampling (SUS) is a technique used in genetic algorithms for selecting potentially useful solutions for recombination. It was introduced by James Baker. 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.g to their fitness) a chance to be chosen.
rdfs:label Stochastic universal sampling , Sobrant Estocàstic (algorisme genètic)
hide properties that link here 
http://dbpedia.org/resource/Sus + http://dbpedia.org/ontology/wikiPageDisambiguates
http://dbpedia.org/resource/List_of_algorithms + , http://dbpedia.org/resource/Fitness_proportionate_selection + , http://dbpedia.org/resource/Selection_%28genetic_algorithm%29 + , http://dbpedia.org/resource/Sus + , http://dbpedia.org/resource/Outline_of_machine_learning + , http://dbpedia.org/resource/Reward-based_selection + http://dbpedia.org/ontology/wikiPageWikiLink
http://en.wikipedia.org/wiki/Stochastic_universal_sampling + http://xmlns.com/foaf/0.1/primaryTopic
http://dbpedia.org/resource/Stochastic_universal_sampling + owl:sameAs
 

 

Enter the name of the page to start semantic browsing from.