[1]LI-Binghan,GAO-Xiaoli,LIU-Sanyang,et al.Learning Bayesian network structures based on mutual information[J].CAAI Transactions on Intelligent Systems,2011,6(1):68-72.
Copy
CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume:
6
Number of periods:
2011 1
Page number:
68-72
Column:
学术论文—智能系统
Public date:
2011-02-25
- Title:
-
Learning Bayesian network structures based on mutual information
- Author(s):
-
LI-Binghan1; GAO-Xiaoli1; LIU-Sanyang1; LI-Zhanguo2
-
1.Department of Mathematics, Xidian University, Xi’an 710071, China;
2.Department of Mechanical Engineering, Xi’an Jiaotong University, Xi’an 710049, China
-
- Keywords:
-
Bayesian network; structure learning; mutual information; independence test; maximum spanning tree
- CLC:
-
TP181
- DOI:
-
-
- Abstract:
-
Constructing Bayesian network structures from data is an NPhard problem, and an improved algorithm was proposed based on mutual information. This algorithm built the initial skeleton using mutual information, refined the initial skeleton by employing the maximum spanning tree algorithm, and then oriented edges according to conditional independence tests. Finally, the optimal network structure was obtained using a greedy search. Numerical experiments show that both the BIC score and structural error made some improvements from previous results, and the number of iterations and running time was greatly reduced. Therefore the structure with highest degree of data matching was shown to be relatively faster as determined by the improved algorithm.