Learning Bayesian Network Equivalence Classes with Ant Colony Optimization

Abstract

Bayesian networks are a useful tool in the representation of uncertain knowledge. This paper proposes a new algorithm called ACO-E, to learn the structure of a Bayesian network. It does this by conducting a search through the space of equivalence classes of Bayesian networks using Ant Colony Optimization (ACO). To this end, two novel extensions of traditional ACO techniques are proposed and implemented. Firstly, multiple types of moves are allowed. Secondly, moves can be given in terms of indices that are not based on construction graph nodes. The results of testing show that ACO-E performs better than a greedy search and other state-of-the-art and metaheuristic algorithms whilst searching in the space of equivalence classes.

References in corpus (7)

• A Transformational Characterization of Equivalent Bayesian Network Structures
• Causal Inference in the Presence of Latent Variables and Selection Bias
• Large-Sample Learning of Bayesian Networks is NP-Hard
• Searching for Bayesian Network Structures in the Space of Restricted Acyclic Partially Directed Graphs
• On Sensitivity of the MAP Bayesian Network Structure to the Equivalent Sample Size Parameter
• Conditions Under Which Conditional Independence and Scoring Methods Lead to Identical Selection of Bayesian Network Models
• A Bayesian Network Scoring Metric That Is Based On Globally Uniform Parameter Priors