Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Linkage problem, distribution estimation, and Bayesian networks.

M Pelikan1, D E Goldberg, E Cantú-Paz

  • 1Department of Computer Science, University of Illinois, Urbana 61801, USA. pelikan@illigal.ge.uiuc.edu

Evolutionary Computation
|September 23, 2000
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Seismogeodetic P-wave Amplitude: No Evidence for Strong Determinism.

Geophysical research letters·2020
Same author

Geodetic Observations of Weak Determinism in Rupture Evolution of Large Earthquakes.

Journal of geophysical research. Solid earth·2019
Same author

Using previous models to bias structural learning in the hierarchical BOA.

Evolutionary computation·2011
Same author

Use of genetic algorithms with multivariate regression for determination of gelatine in historic papers based on FT-IR and NIR spectral data.

Talanta·2010
Same author

Mechanism of DNA substrate recognition by the mammalian DNA repair enzyme, Polynucleotide Kinase.

Nucleic acids research·2009
Same author

The nature and frequency of neovascular age-related macular degeneration.

European journal of ophthalmology·2007
Same journal

Computing Optimal Populations for Binary Problems using Logic Minimization.

Evolutionary computation·2026
Same journal

Enhancing Generalization and Scalability for Multi-Objective Optimization with Population Pre-Training.

Evolutionary computation·2026
Same journal

XCS for Sequential Perceptual Aliasing in Multi-Step Decision Making.

Evolutionary computation·2026
Same journal

A dynamic multi-objective evolutionary algorithm using dual-space prediction and surrogate-based sampling.

Evolutionary computation·2026
Same journal

Adapting MOEA/D to CMA-ES for Dealing with Ill-conditioned Multiobjective Problems.

Evolutionary computation·2026
Same journal

Editorial of the Special Issue: Parallel Problem Solving from Nature PPSN 2024 Extended Versions of Best Paper Candidates.

Evolutionary computation·2026
See all related articles

The Bayesian Optimization Algorithm (BOA) uses Bayesian networks to estimate solution distributions for generating new candidates in evolutionary computation. This approach effectively identifies and combines problem-specific building blocks for efficient problem-solving.

Area of Science:

  • Artificial Intelligence
  • Computational Intelligence
  • Evolutionary Computation

Background:

  • Genetic and evolutionary algorithms often struggle with identifying and combining building blocks.
  • Existing algorithms for estimating distributions can be complex and may require significant domain knowledge.

Purpose of the Study:

  • To introduce a novel algorithm, the Bayesian Optimization Algorithm (BOA), for generating candidate solutions.
  • To leverage Bayesian networks for estimating the joint distribution of promising solutions.
  • To improve the identification and mixing of building blocks in evolutionary computation.

Main Methods:

  • Utilizes Bayesian networks for modeling multivariate data to estimate solution distributions.
  • Implements an algorithm that identifies, reproduces, and mixes building blocks up to a specified order.

Related Experiment Videos

  • Designed to be independent of solution representation variable ordering.

    • Main Results:

    • The Bayesian Optimization Algorithm (BOA) successfully solved most tested additively decomposable problems.
    • The algorithm demonstrated linear or near-linear time complexity relative to problem size.
    • BOA effectively identifies and mixes building blocks with minimal prior problem information.

    Conclusions:

    • The Bayesian Optimization Algorithm (BOA) offers a significant advancement in solving problems with limited domain information.
    • BOA provides an effective method for identifying and combining crucial solution components.
    • The algorithm shows promise for complex optimization tasks within evolutionary computation.