Competing mutating agents for bayesian network structure learning

Authors:
Olivier Regnier-Coudert;John McCall
Affiliations:
IDEAS Research Institute, Robert Gordon University, Aberdeen, UK;IDEAS Research Institute, Robert Gordon University, Aberdeen, UK
Venue:
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Year:
2012

Citing 4
Cited 1

A Bayesian Method for the Induction of Probabilistic Networks from Data

Machine Learning
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data

Machine Learning
A chain-model genetic algorithm for Bayesian network structure learning

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Learning Bayesian network structures by searching for the best ordering with genetic algorithms

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Geometric-based sampling for permutation optimization

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Search and score techniques have been widely applied to the problem of learning Bayesian Networks (BNs) from data. Many implementations focus on finding an ordering of variables from which edges can be inferred. Although varying across data, most search spaces for such tasks exhibit many optima and plateaus. Such characteristics represent a trap for population-based algorithms as the diversity decreases and the search converges prematurely. In this paper, we study the impact of a distance mutation operator and propose a novel method using a population of agents that mutate their solutions according to their respective positions in the population. Experiments on a set of benchmark BNs confirm that diversity is maintained throughout the search. The proposed technique shows improvement on most of the datasets by obtaining BNs of similar of higher quality than those obtained by Genetic Algorithm methods.