返回
Novel binary encoding water cycle algorithm for solving Bayesian network structures learning problem
DOI:10.1016/j.knosys.2018.03.007.png)
摘要
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.
Keyword:
Water cycle algorithm
Binary encoding
Heuristic algorithm
Bayesian network
Structure learning
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.8W
机构
引用论文
Asymptotics of reaction–diffusion fronts with one static and one diffusing reactant具有一个静态和一个扩散反应物的反应扩散前沿的渐近性

