Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Probability Distributions

Probability Distributions

The probability of a random variable x is the likelihood of its occurrence. A probability distribution represents the probabilities of a random variable using a formula, graph, or table. There are two types of probability distribution– discrete probability distribution and continuous probability distribution.
A discrete probability distribution is a probability distribution of discrete random variables. It can be categorized into binomial probability distribution and Poisson probability...

Sampling Distribution

Sampling Distribution

Given simple random samples of size n from a given population with a measured characteristic such as mean, proportion, or standard deviation for each sample, the probability distribution of all the measured characteristics is called a sampling distribution. How much the statistic varies from one sample to another is known as the sampling variability of a statistic. You typically measure the sampling variability of a statistic by its standard error. The standard error of the mean is an example...

Distributions to Estimate Population Parameter

Distributions to Estimate Population Parameter

The accurate values of population parameters such as population proportion, population mean, and population standard deviation (or variance) are usually unknown. These are fixed values that can only be estimated from the data collected from the samples. The estimates of each of these parameters are sample proportion, the sample mean, and sample standard deviation (or variance). To obtain the values of these sample statistics, data are required that have particular distribution and central...

Choosing Between z and t Distribution

Choosing Between z and t Distribution

The z and the Student t distribution estimate the population mean using the sample mean and standard deviation. However, to decide which distribution to use for a calculation, one needs to determine the sample size, the nature of the distribution, and whether the population standard deviation is known. If the population standard deviation is known and the population is normally distributed, or if the sample size is greater than 30, the z distribution is preferred. The Student t distribution is...

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for k_a Estimation

This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

You might also read

Related Articles

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

Sort by

Same author

Alkaloid extract of Corydalis yanhusuo inhibits angiogenesis via targeting vascular endothelial growth factor receptor signaling.

BMC complementary and alternative medicine·2019

Same author

Interaction between <i>ELMO1</i> gene polymorphisms and environment factors on susceptibility to diabetic nephropathy in Chinese Han population.

Diabetology & metabolic syndrome·2019

Same author

Clinical and Radiographic Outcomes of Modified Unilateral Open-door Laminoplasty with Posterior Muscle-Ligament Complex Preservation for Cervical Spondylotic Myelopathy.

Spine·2019

Same author

Predictive value of serum β-human chorionic gonadotropin for early pregnancy outcomes.

Archives of gynecology and obstetrics·2019

Same author

Quantifying the scale effect in geospatial big data using semi-variograms.

PloS one·2019

Same author

pTuneos: prioritizing tumor neoantigens from next-generation sequencing data.

Genome medicine·2019

Search research articles

Related Experiment Video

Updated: Jul 10, 2026

Quantification of Information Encoded by Gene Expression Levels During Lifespan Modulation Under Broad-range Dietary Restriction in C. elegans

Quantification of Information Encoded by Gene Expression Levels During Lifespan Modulation Under Broad-range Dietary Restriction in C. elegans

Published on: August 16, 2017

Space complexity of estimation of distribution algorithms.

Yong Gao¹, Joseph Culberson

¹Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2E8. ygao@cs.ualberta.ca

Evolutionary Computation

|May 20, 2005

Summary

This study analyzes the space complexity of Estimation of Distribution Algorithms (EDAs), revealing that common implementations like factorized distribution and Bayesian network algorithms exhibit exponential space requirements, even for problems with sparse structures.

More Related Videos

Analysis and Specification of Starch Granule Size Distributions

Analysis and Specification of Starch Granule Size Distributions

Published on: March 4, 2021

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

Related Experiment Videos

Last Updated: Jul 10, 2026

Quantification of Information Encoded by Gene Expression Levels During Lifespan Modulation Under Broad-range Dietary Restriction in C. elegans

Quantification of Information Encoded by Gene Expression Levels During Lifespan Modulation Under Broad-range Dietary Restriction in C. elegans

Published on: August 16, 2017

Analysis and Specification of Starch Granule Size Distributions

Analysis and Specification of Starch Granule Size Distributions

Published on: March 4, 2021

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

Area of Science:

Computer Science
Artificial Intelligence
Optimization Algorithms

Background:

Estimation of Distribution Algorithms (EDAs) are a class of genetic algorithm variants that use probabilistic models.
Understanding the computational resources, particularly space complexity, is crucial for algorithm scalability and practical application.

Purpose of the Study:

To investigate and characterize the space complexity of Estimation of Distribution Algorithms (EDAs).
To analyze two specific EDA implementations: factorized distribution algorithms and Bayesian network-based algorithms.

Main Methods:

Analysis of the inherent properties of EDAs.
Development of criteria to define the space complexity for typical EDA implementations.
Utilizing random additive functions as a benchmark for complexity analysis.

Main Results:

The space complexity of factorized distribution algorithms and Bayesian network-based algorithms was proven to be exponential with respect to problem size.
This exponential complexity holds true even when the optimization problem exhibits a very sparse interaction structure.

Conclusions:

Standard implementations of EDAs, including factorized distribution and Bayesian network approaches, face significant space complexity challenges.
The findings suggest limitations in the scalability of these EDA types for large or complex optimization problems, irrespective of interaction sparsity.