Sharp Bounds for Genetic Drift in Estimation of Distribution Algorithms

Estimation of distribution algorithms (EDAs) are a successful branch of evolutionary algorithms (EAs) that evolve a probabilistic model instead of a population. Analogous to genetic drift in EAs, EDAs also encounter the phenomenon that the random sampling in the model update can move the sampling fr...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on evolutionary computation Ročník 24; číslo 6; s. 1140 - 1149
Hlavní autori:	Doerr, Benjamin, Zheng, Weijie
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.12.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers
Predmet:	Computational modeling Computer Science Drift estimation Estimation of distribution algorithms (EDAs) Evolutionary algorithms Genetic algorithms genetic drift Genetics Iterative methods Machine learning Probabilistic logic Probabilistic models Random sampling running time analysis Sociology Statistics theory Time-frequency analysis
ISSN:	1089-778X, 1941-0026
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!