Skip navigation

An improved evolutionary approach-based hybrid algorithm for Bayesian network structure learning in dynamic constrained search space

An improved evolutionary approach-based hybrid algorithm for Bayesian network structure learning in dynamic constrained search space

Dai, Jingguo, Ren, Jia ORCID: 0000-0002-4000-1353, Du, Wencai, Shikhin, Vladimir and Ma, Jixin (2018) An improved evolutionary approach-based hybrid algorithm for Bayesian network structure learning in dynamic constrained search space. Neural Computing and Applications. ISSN 0941-0643 (Print), 1433-3058 (Online) (In Press) (doi:https://doi.org/10.1007/s00521-018-3650-7)

[img]
Preview
PDF (Author's Accepted Manuscript)
24315 MA_Evolutionary_Approach-based_Hybrid_Algorithm_Bayesian_Search_(AAM)_2018.pdf - Accepted Version

Download (33MB) | Preview

Abstract

Learning Bayesian network (BN) structures from data is a NP-hard problem due to the vastness of the solution space. To address this issue, hybrid approaches that integrate the constraint-based (CB) method and the score-and-search (SS) method have been developed in the literature, but when the constrained search space is fixed and inaccurate, it is very likely to lose the optimal solution, leading to low learning accuracy. Besides, due to the randomness and uncertainty of the search, it is difficult to preserve the superiority of the structures, resulting in low learning efficiency. Therefore, we propose a novel hybrid algorithm based on an improved evolutionary approach to explore BN structure with highest matching degree of data set in dynamic constrained search space. The proposed algorithm involves two phases, namely the CB phase and the SS phase. In the CB phase, the mutual information is utilized as the restriction to limit the search space, and a binding parameter is introduced to the novel encoding scheme so that the search space can be dynamically changed in the evolutionary process. In the SS phase, a new operator is developed to pass on the excellent genes from generation to generation, and an update principle for the binding parameter is exploited for the dynamic selection of the search space. We conduct the comparative experiments on the benchmark network data sets and provide performance and applicability analysis of our proposed method. The experimental results show that the new algorithm is effective in learning the BN structures.

Item Type: Article
Uncontrolled Keywords: Bayesian networks, structure learning, mutual information, genetic algorithm
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Faculty / Department / Research Group: Faculty of Architecture, Computing & Humanities
Faculty of Architecture, Computing & Humanities > Centre for Computer & Computational Science
Faculty of Architecture, Computing & Humanities > Department of Computing & Information Systems
Last Modified: 01 Aug 2019 01:38
Selected for GREAT 2016: None
Selected for GREAT 2017: None
Selected for GREAT 2018: None
Selected for GREAT 2019: GREAT 2
URI: http://gala.gre.ac.uk/id/eprint/24315

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics