Journal of Systems Engineering and Electronics ›› 2010, Vol. 32 ›› Issue (6): 1325-1328.doi: 10.3969/j.issn.1001-506X.2010.06.044

Previous Articles     Next Articles

Construction algorithm of MPD-JT for Bayesian networks based on full conditional independence

ZHU Ming-min,LIU Wei, YANG You-long   

  1. Dept. of Mathematics, Xidian Univ., Xi’an 710071, China
  • Online:2010-06-28 Published:2010-01-03

PDF (PC)

Abstract:

As the decomposition of Bayesian networks (BN) into their maximal prime sub-graph is a NP-hard problem, a new method for constructing the maximal prime sub-graph junction tree (MPD-JT) of  BN is presented. This approach obtains the MPD of BN motivated by the full conditional independence information encoded in the moral graph of the original BN and uses these MPDs as a cluster of nodes to construct a junction tree, it also avoids the process of triangulation and reduces the time complexity by eliminating some coincident nodes. The correctness of the method is proven and the validity of the algorithm is analyzed by an example．

[an error occurred while processing this directive]