Abstract

Bayesian Network (BN) structure learning is a complex search problem, generally characterized by multimodality and epistasis. Genetic Algorithms (GAs) have been extensively used to pursue the BN structure learning task. This paper presents a new approach which incorporates the structural properties of the problem into GA mechanisms. The proposed approach uses a new recombination operator named Parent Set crossover, capable of reducing the disruptive action of the recombination process and enhancing its exploitative power. The new operator has been compared with a comprehensive set of other crossover operators as part of two genetic strategies: a canonical GA and a GA with an adaptive mutation scheme. All examined crossover operators were applied on both canonical and adaptive GAs and then compared in terms of various performance metrics. The experiments involve performance measures at the end of evolution as well as their convergence behavior across generations. The performance of the proposed method was also compared with the state-of-the-art non-evolutionary BN structure learning algorithms. Results show that the proposed recombination method enhances the algorithmic efficiency over a variety of test cases of different size.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call