Learning of Bayesian networks by a local discovery ant colony algorithm
Pedro C. Pinto, Andreas Nägele, Mathäus Dejori, Thomas A. Runkler, João M. C. Sousa · 2008
Bayesian networks (BNs) are knowledge representation tools capable of representing dependence or independence relationships among random variables that compose a problem domain. Bayesian networks learned from data sets are receiving increasing attention within the community of researchers of uncertainty in artificial intelligence, due to their capacity to provide good inference models and to discover the structure of complex domains. One approach to learning BNs from data is to use a scoring metric to evaluate the fitness of any given candidate network for the database, and apply an optimization procedure to explore the set of candidate networks. Among the most frequently used optimization methods for this purpose is greedy search, either deterministic or stochastic. This article proposes a hybrid Bayesian network learning algorithm MMACO, based on the local discovery algorithm max-min parents and children (MMPC) and ant colony optimization (ACO). MMPC is used to construct the skeleton of the Bayesian network and then ACO is used to orientate its edges, thus returning the final structure. We apply MMACO (max-min ACO) to several sets of benchmark networks and show that it outperforms greedy search (GS) and simulated annealing (SA) algorithms.