中文摘要：

本文基于分解贝叶斯网道义图改进了传播算法的三角化图及连接树的构建．证明了寻找最优三角化图问题可以分解为素块上独立的小的子问题．于是，所有素块的最优三角化图的并即为贝叶斯网的最优三角化图．进一步，我们给出了一个算法，通过连接各个素块的最优三角化图的团树来构建全局最优三角化图的团树．我们进行了模拟实验来展示分解对于求三角化图及连接树的效果．

英文摘要：

In this paper, we improve the construction of triangulation and junction tree in propagation algorithm by decomposing the moral graph of Bayesian network into its prime blocks. It is proved that the problem of finding optimal triangulation can be split into the smaller and independent problems on the prime blocks without losing optimality. Thus, the union of optimal triangulations of all the prime blocks is the desired optimal triangulation of Bayesian network. Furthermore, we give an algorithm to construct a clique junction tree of the optimal triangulation by connecting clique junction trees of the optimal triangulations. Experiments are shown to evaluate the performance of decomposition in compilation stage of propagation algorithm.