Incorporating Regular Vines in Estimation of Distribution Algorithms

@inproceedings{SalinasGutirrez2013IncorporatingRV,
  title={Incorporating Regular Vines in Estimation of Distribution Algorithms},
  author={Rogelio Salinas-Guti{\'e}rrez and Arturo Hern{\'a}ndez Aguirre and Enrique Ra{\'u}l Villa Diharce},
  booktitle={EVOLVE},
  year={2013}
}
This chapter presents the incorporation and use of regular vines into Estimation of Distribution Algorithms for solving numerical optimization problems. Several kinds of statistical dependencies among continuous variables can be taken into account by using regular vines. This work presents a procedure for selecting the most important dependencies in EDAs by truncating regular vines. Moreover, this chapter also shows how the use of mutual information in the learning of graphical models implies a… 
1 Citations

Vine copula-based EDA for dynamic multiobjective optimization

Dynamic Multiobjective Problems cover a set of real-world problems that have many conflicting objectives. These problems are challenging and well known by the dynamic nature of their objective

References

SHOWING 1-10 OF 88 REFERENCES

Dependence trees with copula selection for continuous estimation of distribution algorithms

The experimental results show that the proposed EDA has a better performance than EDAs based on Gaussian assumptions and is possible to build a very flexible joint distribution as a probabilistic model.

Using Copulas in Estimation of Distribution Algorithms

A new way of modeling probabilistic dependencies in Estimation of Distribution Algorithm (EDAs) is presented. By means of copulas it is possible to separate the structure of dependence from marginal

Vines: A new graphical model for dependent random variables

A new graphical model, called a vine, for dependent random variables, which generalize the Markov trees often used in modelling high-dimensional distributions and is weakened to allow for various forms of conditional dependence.

An Estimation of Distribution Algorithm Based on Clayton Copula and Empirical Margins

The empirical distribution and Clayton copula are used to implement the proposed copula Estimation of Distribution Algorithm (copula EDA), and the experimental results show that the proposed algorithm is equivalent to some conventional continuous EDAs in performance.

A Review on Estimation of Distribution Algorithms

  • P. Larrañaga
  • Mathematics
    Estimation of Distribution Algorithms
  • 2002
This chapter reviews the Estimation of Distribution Algorithms proposed for the solution of combinatorial optimization problems and optimization in continuous domains using one unified notation.

Bivariate empirical and n-variate Archimedean copulas in estimation of distribution algorithms

This paper investigates the use of empirical and Archimedean copulas as probabilistic models of continuous estimation of distribution algorithms (EDAs) and proposes copula-based EDAs that achieve a better behaviour than previous approaches.

Using Gaussian Copulas in Supervised Probabilistic Classification

This chapter studies the performance of a simple probabilistic classifier based on the Gaussian copula function and shows this simple classifier has an excellent performance.

Understanding Relationships Using Copulas

This article introduces actuaries to the concept of “copulas,” a tool for understanding relationships among multivariate outcomes, a function that links univariate marginals to their full multivariate distribution, and several families of copulas that have appeared in the literature.

Using Gumbel copula and empirical marginal distribution in Estimation of Distribution Algorithm

An EDA with Gumbel copula is proposed, which simplifies the operator to estimating the multivariate distribution and shows that the proposed algorithm is equivalent to some conventional continuous EDAs in performance.

The vine copula method for representing high dimensional dependent distributions: application to continuous belief nets

It is shown that a continuous belief net can be represented as a regular vine, where an arc from node i to j is associated with a (conditional) rank correlation between i and j.
...