Abductive inference in Bayesian networks using distributed overlapping swarm intelligence

详细信息    查看全文

• 作者：Nathan Fortier ; John Sheppard ; Shane Strasser
• 关键词：Abductive inference ; Particle swarm optimization ; Distributed computing
• 刊名：Soft Computing - A Fusion of Foundations, Methodologies and Applications
• 出版年：2015
• 出版时间：April 2015
• 年：2015
• 卷：19
• 期：4
• 页码：981-1001
• 全文大小：2,976 KB
• 参考文献：1. Belding T (1995) The distributed genetic algorithm revisited. In: Proceedings of the International Conference on genetic algorithms, pp 114-21
  2. Bergh, F, Engelbrecht, A (2000) Cooperative learning in neural networks using particle swarm optimizers. South African Computer J 26: pp. 90-94
  3. Boyd, S, Parikh, N, Chu, E, Peleato, B, Eckstein, J (2011) Distributed optimization and statistical learning via the alternating direction method of multipliers. Found Trends Mach Learn 3: pp. 1-122 CrossRef
  4. Campos, L, Gamez, J, Moral, S (1999) Partial abductive inference in Bayesian belief networks using a genetic algorithm. Pattern Recogn Lett 20: pp. 1211-1217 CrossRef
  5. Campos, L, Gamez, J, Moral, S (2001) Partial abductive inference in Bayesian belief networks by simulated annealing. Int J Approx Reason 27: pp. 263-283 CrossRef
  6. Dagum, P, Luby, M (1993) Approximating probabilistic inference in Bayesian belief networks is NP-hard. Artif Intell 60: pp. 141-153 CrossRef
  7. Dawid, A (1992) Applications of a general propagation algorithm for probabilistic expert systems. Stat Comput 2: pp. 25-36 CrossRef
  8. Dechter R (1996) Bucket elimination: a unifying framework for probabilistic inference. In: Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence. Morgan Kaufmann Publishers Inc., pp 211-19
  9. Dechter R, Irina R (2003) Mini-buckets: a general scheme for bounded inference. J ACM 50(2):107-53
  10. Dorigo, M, Birattari, M, Stutzle, T (2006) Ant colony optimization. Comput Intell Magazine IEEE 1: pp. 28-39 CrossRef
  11. Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: Micro machine and human science, 1995. MHS-5., Proceedings of the Sixth International Symposium on, IEEE, pp 39-3
  12. Elvira Consortium (2002) Elvira: an environment for creating and using probabilistic graphical models. In: Proceedings of the first European workshop on probabilistic graphical models, pp 222-30
  13. Fortier N, Sheppard JW, Pillai KG (2012) DOSI: training artificial neural networks using overlapping swarm intelligence with local credit assignment. In: Soft computing and intelligent systems (SCIS) and 13th International Symposium on advanced intelligent systems (ISIS), 2012 Joint 6th International Conference on, IEEE, pp 1420-425
  14. Fortier N, Sheppard JW, Pillai KG (2013) Bayesian abductive inference using overlapping swarm intelligence. In: 2013 IEEE Symposium on swarm intelligence (SIS 2013), pp 263-70
  15. Gamez J (1998) Inferencia abductiva en redes causales. In: Thesis. Departamento de Ciencias de la Computacin e I.A. Escuela Tcnica Superior de Ingeniera Informtica
  16. Gandomi, AH, Alavi, AH (2012) Krill herd: a new bio-inspired optimization algorithm. Commun Nonlinear Sci Numer Simul 17: pp. 4831-4845 CrossRef
  17. Gandomi, AH, Yang, XS, Alavi, AH (2013) Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng Computers 29: pp. 17-35 CrossRef
  18. Gelsema, E (1995) Abductive reasoning in Bayesian belief networks using a genetic algorithm. Pattern Recogn Lett 16: pp. 865-871 CrossRef
  19. Haberman, BK, Sheppard, JW (2012) Overlapping particle swarms for energy-efficient routing in sensor networks. Wireless Netw 18: pp. 351-363 CrossRef
  20. Karaboga, D, Basturk, B (2008) On the performance of artificial bee colony (abc) algorithm. Appl Soft Comput 8: pp. 687-697 CrossRef
  21. Kask K, Dechter R (1999) Stochastic local search for Bayesian networks. In: Workshop on AI and statistics. Morgan Kaufman Publishers
• 刊物类别：Engineering
• 刊物主题：Numerical and Computational Methods in Engineering
  Theory of Computation
  Computing Methodologies
  Mathematical Logic and Foundations
  Control Engineering
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1433-7479

文摘

In this paper we propose several approximation algorithms for the problems of full and partial abductive inference in Bayesian belief networks. Full abductive inference is the problem of finding the \(k\) most probable state assignments to all non-evidence variables in the network while partial abductive inference is the problem of finding the \(k\) most probable state assignments for a subset of the non-evidence variables in the network, called the explanation set. We developed several multi-swarm algorithms based on the overlapping swarm intelligence framework to find approximate solutions to these problems. For full abductive inference a swarm is associated with each node in the network. For partial abductive inference, a swarm is associated with each node in the explanation set and each node in the Markov blankets of the explanation set variables. Each swarm learns the value assignments for the variables in the Markov blanket associated with that swarm’s node. Swarms learning state assignments for the same variable compete for inclusion in the final solution.