This paper discusses the potential of Particle Swarm Optimisation (PSO) for inducing Bayesian Networks (BNs). Specifically, we detail two methods which adopt the search and score approach to BN learning. The two algorithms are similar in that they both use PSO as the search algorithm, and the K2 metric to score the resulting network. The difference lies in the way networks are constructed. The CONstruct And Repair (CONAR) algorithm generates structures, validates, and repairs if required, and the REstricted STructure (REST) algorithm, only permits valid structures to be developed. Initial experiments indicate that these approaches produce promising results when compared to other BN learning strategies.
|Title of host publication||Proceedings of the World Congress on Engineering 2007|
|Editors||S.I. Ao, Len Gelman, David WL Hukins, Andrew Hunter, A. M. Korsunsky|
|Number of pages||6|
|ISBN (Electronic)||9789889867157, 9789889867126|
|Publication status||Published - 30 Jun 2007|
- Particle Swarm Optimisation
- Bayesian Network Construction
Cowie, J., Oteniya, L., & Coles, R. (2007). Particle swarm optimisation for learning Bayesian networks. In S. I. Ao, L. Gelman, D. WL. Hukins, A. Hunter, & A. M. Korsunsky (Eds.), Proceedings of the World Congress on Engineering 2007 (Vol. 1, pp. 71-76). Newswood .