论文信息 - A hybrid discrete PSO-SA algorithm to find optimal elimination orderings for Bayesian networks

A hybrid discrete PSO-SA algorithm to find optimal elimination orderings for Bayesian networks

In this paper, a hybrid algorithm named DPSOSA is proposed to find near-to-optimal elimination orderings in Bayesian networks. DPSO-SA is a discrete particle swarm optimization method enhanced by simulated annealing. Computational tests show that this hybrid method is very effective and robust for the elimination ordering problem.

Dantong Ouyang | Yuxin Ye | Xuchu Dong | Dianbo Cai | Yonggang Zhang

[1] Chunguang Zhou,et al. Particle swarm optimization for traveling salesman problem , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[2] Rina Dechter,et al. AND/OR search spaces for graphical models , 2007, Artif. Intell..

[3] Jose Miguel Puerta,et al. Searching for the best elimination sequence in Bayesian networks by using ant colony optimization , 2002, Pattern Recognit. Lett..

[4] Uue Kjjrull. Triangulation of Graphs { Algorithms Giving Small Total State Space Triangulation of Graphs { Algorithms Giving Small Total State Space , 1990 .

[5] Wilson X. Wen,et al. Optimal decomposition of belief networks , 1990, UAI.

[6] Serafín Moral,et al. Heuristic Algorithms for the Triangulation of Graphs , 1994, IPMU.

[7] Pedro Larrañaga,et al. Decomposing Bayesian networks: triangulation of the moral graph with genetic algorithms , 1997, Stat. Comput..

[8] Pedro Larrañaga,et al. Triangulation of Bayesian networks with recursive estimation of distribution algorithms , 2009, Int. J. Approx. Reason..

[9] Frank Jensen,et al. Optimal junction Trees , 1994, UAI.

[10] Yi Zhang,et al. Predicting intrusion goal using dynamic Bayesian network with transfer probability estimation , 2009, J. Netw. Comput. Appl..

[11] Hao Wang,et al. Triangulation of Bayesian Networks Using an Adaptive Genetic Algorithm , 2006, ISMIS.