Abstract
Learning the structure of Bayesian networks (BNs) has received increasing attention. Based on score+search methods, many heuristic algorithms have been introduced to search the optimal network with the maximum score metric. To overcome the drawback of ant colony optimization (ACO) in solving the BN structure learning, this paper introduces a new algorithm for learning BNs based on the hybrid ACO and differential evolution (DE). In the proposed hybrid algorithm, the entire ant colony is divided into different groups, among which DE operators are adopted to lead the evolutionary process. Differ from the widely used methodologies that combine ACO with constraint-based techniques, our work mainly focuses on improving the inherent search capability of ACO. Experimental results show that the hybrid algorithm outperforms the basic ACO in learning BN structure in terms of convergence and accuracy.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
