.png){kind=icon}
Return
Novel binary encoding water cycle algorithm for solving Bayesian network structures learning problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2018.03.007.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Constructing Bayesian network structures from data is a computationally hard task. One important method to learn Bayesian network structures uses the meta-heuristic algorithms. In this paper, a novel binary encoding water cycle algorithm is proposed for the first time to address the Bayesian network structures learning problem. In this study, the sea, rivers and streams correspond to the candidate Bayesian network structures. Since it is a discrete problem to find an optimal structure, the logic operators have been used to calculate the positions of the individuals. Meanwhile, to balance the exploitation and exploration abilities of the algorithm, the ways how rivers and streams flow to the sea and the evaporation process have been designed with the new strategies. Experiments on well-known benchmark networks demonstrate that the proposed algorithm is capable of identifying the optimal or near-optimal structures. In the comparison to the use of the other algorithms, our method performs well and turns out to have the better solution quality. (C) 2018 Published by Elsevier B.V.
Keywords:
Water cycle algorithm
Binary encoding
Heuristic algorithm
Bayesian network
Structure learning
Journal
K
IF:
7.6
Papers:
1.3W
Citations:
5.0W
Organization
Cited Papers
Malaria parasites, immune challenge, MHC variability, and predator avoidance in a passerine bird
OAAI
.png){kind=icon}
OAAIShareSaveShareSave
View more