Learning Bayesian Network Structure Using a MultiExpert Approach

Author(s):  
Francesco Colace ◽  
Massimo De Santo ◽  
Luca Greco

The learning of a Bayesian network structure, especially in the case of wide domains, can be a complex, time-consuming and imprecise process. Therefore, the interest of the scientific community in learning Bayesian network structure from data is increasing: many techniques or disciplines such as data mining, text categorization, and ontology building, can take advantage from this process. In the literature, there are many structural learning algorithms but none of them provides good results for each dataset. This paper introduces a method for structural learning of Bayesian networks based on a MultiExpert approach. The proposed method combines five structural learning algorithms according to a majority vote combining rule for maximizing their effectiveness and, more generally, the results obtained by using of a single algorithm. This paper shows an experimental validation of the proposed algorithm on standard datasets.

Author(s):  
Christophe Gonzales ◽  
Axel Journe ◽  
Ahmed Mabrouk

Exploiting experts' knowledge can significantly increase the quality of the Bayesian network (BN) structures produced by learning algorithms. However, in practice, experts may not be 100% confident about the opinions they provide. Worst, the latter can also be conflicting. Including such specific knowledge in learning algorithms is therefore complex. In the literature, there exist a few score-based algorithms that can exploit both data and the knowledge about the existence/absence of arcs in the BN. But, as far as we know, no constraint-based learning algorithm is capable of exploiting such knowledge. In this paper, we fill this gap by introducing the mathematical foundations for new independence tests including this kind of information. We provide a new constraint-based algorithm relying on these tests as well as experiments that highlight the robustness of our method and its benefits compared to other constraint-based learning algorithms.


Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 462
Author(s):  
Jie Wei ◽  
Yufeng Nie ◽  
Wenxian Xie

The loop cutset solving algorithm in the Bayesian network is particularly important for Bayesian inference. This paper proposes an algorithm for solving the approximate minimum loop cutset based on the loop cutting contribution index. Compared with the existing algorithms, the algorithm uses the loop cutting contribution index of nodes and node-pairs to analyze nodes from a global perspective, and select loop cutset candidates with node-pair as the unit. The algorithm uses the parameter μ to control the range of node pairs, and the parameter ω to control the selection conditions of the node pairs, so that the algorithm can adjust the parameters according to the size of the Bayesian networks, which ensures computational efficiency. The numerical experiments show that the calculation efficiency of the algorithm is significantly improved when it is consistent with the accuracy of the existing algorithm; the experiments also studied the influence of parameter settings on calculation efficiency using trend analysis and two-way analysis of variance. The loop cutset solving algorithm based on the loop cutting contribution index uses the node-pair as the unit to solve the loop cutset, which helps to improve the efficiency of Bayesian inference and Bayesian network structure analysis.


2021 ◽  
Vol 426 ◽  
pp. 35-46
Author(s):  
Xiangyuan Tan ◽  
Xiaoguang Gao ◽  
Zidong Wang ◽  
Chuchao He

Sign in / Sign up

Export Citation Format

Share Document