Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

Drift and scaling in estimation of distribution algorithms.

Evolutionary computation - 1 Jan 2005

Shapiro J L

Abstract excerpt

This paper considers a phenomenon in Estimation of Distribution Algorithms (EDA) analogous to drift in population genetic dynamics. Finite population sampling in selection results in fluctuations which get reinforced when the probability model is updated. As a consequence, any probability model which can generate only a single set of values with probability 1 can be an attractive fixed point of the algorithm. To...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Algorithms
Share to Bayes Theorem
Share to Biological Evolution

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Computational Biology

Share to Markov Chains

Share to Models, Statistical

Share to Normal Distribution

Share to Population Dynamics

Source

Identifiers

PMID: 15901428
DOI: 10.1162/1063656053583414

Genes

EDA

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 7 Sept 2026. Manifest publication-graph-cohort-2026-09-07.1.

Source receipt: pubmed, retrieved 7 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Drift and scaling in estimation of distribution algorithms.PMID 15901428Read ↗

Update on estimation of mutation rates using data from fluctuation experiments.Semantic proximity Read ↗

Statistical and algorithmic methods for fluctuation analysis with SALVADOR as an implementation.Semantic proximity Read ↗

Salvador Luria and Max Delbrück on Random Mutation and Fluctuation Tests.Semantic proximity Read ↗

Completely derandomized self-adaptation in evolution strategies.Semantic proximity Read ↗

Maximizing Drift Is Not Optimal for Solving OneMax.Semantic proximity Read ↗

Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift.Semantic proximity Read ↗

Fluctuation analysis: can estimates be trusted?Semantic proximity Read ↗

Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: a case study for the multidimensional knapsack problem.Semantic proximity Read ↗

The effectiveness of mutation operation in the case of Estimation of Distribution Algorithms.Semantic proximity Read ↗

The Dynamics of Cumulative Step Size Adaptation on the Ellipsoid Model.Semantic proximity Read ↗

A normed space of genetic operators with applications to scalability issues.Semantic proximity Read ↗

On the Baldwin effect.Semantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.