Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms
From MaRDI portal
Publication:3509448
DOI10.1007/978-3-540-72960-0_18zbMath1211.90306OpenAlexW2101438873MaRDI QIDQ3509448
Stefan Minner, Jörn Grahl, Peter A. N. Bosman
Publication date: 1 July 2008
Published in: Natural Computing Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72960-0_18
evolutionary computationBayesian networkcontinuous domaindistribution algorithmunivariate factorization
Related Items (2)
Incorporating Regular Vines in Estimation of Distribution Algorithms ⋮ A review of message passing algorithms in estimation of distribution algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- Scalability of the Bayesian optimization algorithm.
- Multi-objective optimization with diversity preserving mixture-based iterated density estimation evolutionary algorithms.
- Mathematical modelling of UMDA\(_{c}\) algorithm with tournament selection. Behaviour on linear and quadratic functions
- Linkage learning through probabilistic expression.
- Learning probability distributions in continuous evolutionary algorithms -- a comparative review
- Optimization via simulation: A review
- Schemata, distributions and graphical models in evolutionary optimization
- Inexact graph matching by means of estimation of distribution algorithms
- Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
- Learning Bayesian networks: The combination of knowledge and statistical data
- Matching inductive search bias and problem structure in continuous Estimation-of-Distribution Algorithms
- Scalable optimization via probabilistic modeling. From algorithms to applications.
- Learning Bayesian networks in the space of structures by estimation of distribution algorithms
- Simulation optimization with countably infinite feasible regions
- Optimum branchings
- Approximating discrete probability distributions with dependence trees
This page was built for publication: Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms