Abstract
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.
Original language | English |
---|---|
Title of host publication | Proceedings of the World Congress on Engineering, WCE 2007, London, UK, 2-4 July, 2007 |
Subtitle of host publication | Lecture notes in engineering and computer science, Volume 1 |
Editors | S. I. Ao, L. Gelman |
Place of Publication | Hong Kong |
Publisher | International Association of Engineers |
Pages | 71-76 |
Number of pages | 6 |
ISBN (Print) | 9789889867157 |
Publication status | Published - 2007 |
Event | World Congress on Engineering 2007 - South Kensington Campus, Imperial College London, London, United Kingdom Duration: 2 Jul 2007 → 4 Jul 2007 http://www.iaeng.org/WCE2007/ |
Conference
Conference | World Congress on Engineering 2007 |
---|---|
Abbreviated title | WCE 2007 |
Country/Territory | United Kingdom |
City | London |
Period | 2/07/07 → 4/07/07 |
Internet address |