Estimation of Distribution Algorithms
暂无分享,去创建一个
Partial abductive inference in Bayesian networks is intended as the process of generating the J( most probable configurations for a distinguished subset of the network variables (explanation set), given some observations (evidence). This problem, also known as the Maximum a Posteriori Problem, is known to be NP-hard, so exact computation is not always possible. As partial abductive inference in Bayesian networks can be viewed as a combinatorial optimization problem, Genetic Algorithms have been successfully applied to give an approximate algorithm for it (de Campos et al., 1999). In this work we approach the problem by means of Estimation of Distribution Algorithms, and an empirical comparison between the results obtained by Genetic Algorithms and Estimation of Distribution Algorithms is carried out.