Ant colony optimization for learning Bayesian networks

✍ Scribed by Luis M. de Campos; Juan M. Fernández-Luna; José A. Gámez; José M. Puerta

• Publisher: Elsevier Science
• Year: 2002
• Tongue: English
• Weight: 348 KB
• Volume: 31
• Category: Article
• ISSN: 0888-613X
• DOI: 10.1016/s0888-613x(02)00091-9

✦ Synopsis

One important approach to learning Bayesian networks (BNs) from data uses a scoring metric to evaluate the fitness of any given candidate network for the data base, and applies a search procedure to explore the set of candidate networks. The most usual search methods are greedy hill climbing, either deterministic or stochastic, although other techniques have also been used. In this paper we propose a new algorithm for learning BNs based on a recently introduced metaheuristic, which has been successfully applied to solve a variety of combinatorial optimization problems: ant colony optimization (ACO). We describe all the elements necessary to tackle our learning problem using this metaheuristic, and experimentally compare the performance of our ACObased algorithm with other algorithms used in the literature. The experimental work is carried out using three different domains: ALARM, INSURANCE and BOBLO.