An Improved Genetic Algorithm for Optimal Tree Decomposition of Bayesian Networks
Lists
Only you see this
Abstract
In this paper, we present a novel triangulation heuristic and a new genetic algorithm to solve the problem of optimal tree decomposition of Bayesian networks. The heuristic, named MinFillWeight, aims to select variables minimizing the multiplication of the weights on nodes of fill-in edges. The genetic algorithm, named IDHGA, employs a new order-reserving crossover operator and a mutation operator based on triangulation heuristics. Moreover, IDHGA utilizes population diversity to identify stagnation and convergence as well as to guide the search procedure. Experiments on representative benchmarks show that IDHGA utilizing MinFillWeight heuristic posses better performance and robustness than other swarm intelligence methods.
BibTeX
@article{dong2011improved,
author = {Xuchu Dong and Zhanshan Li and Dantong Ouyang and Yuxin Ye and Haihong Yu and Yonggang Zhang},
title = {{An Improved Genetic Algorithm for Optimal Tree Decomposition of Bayesian Networks}},
journal = {International Journal of Advancements in Computing Technology},
year = {2011},
doi = {10.4156/ijact.vol3.issue2.12},
}Loading related content...