Using Maximum Entropy and Generalized Belief Propagation in Estimation of Distribution Algorithms
From MaRDI portal
Recommendations
- Maximum Entropy Distribution Estimation with Generalized Regularization
- Generalized maximum entropy estimation
- CALCULATING MAXIMUM-ENTROPY PROBABILITY DENSITIES FOR BELIEF FUNCTIONS
- Fast fitness improvements in estimation of distribution algorithms using belief propagation
- Estimation and optimization of MLE maximum entropy probability density
- Consistency and generalization bounds for maximum entropy density estimation
- On the way towards a generalized entropy maximization procedure
- An efficient algorithm to generate maximum entropy distributions
- Maximum-entropy estimated distribution model for classification problems
Cited in
(9)- Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning.
- A review of message passing algorithms in estimation of distribution algorithms
- The factorized distribution algorithm and the minimum relative entropy principle
- A Boltzmann based estimation of distribution algorithm
- On the use of factorized distribution algorithms for problems defined on graphs
- Convergence theorems of estimation of distribution algorithms
- Fast fitness improvements in estimation of distribution algorithms using belief propagation
- MN-EDA and the use of clique-based factorisations in EDAs
- CALCULATING MAXIMUM-ENTROPY PROBABILITY DENSITIES FOR BELIEF FUNCTIONS
This page was built for publication: Using Maximum Entropy and Generalized Belief Propagation in Estimation of Distribution Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649197)