中文摘要：

K2算法是学习贝叶斯网络结构的经典算法。针对K2算法依赖最大父节点数和节点序的不足,以及蚁群算法搜索空间庞大的问题,提出了一种新的贝叶斯结构学习算法-MWST-ACO-K2算法。该算法通过计算互信息建立最大支撑树（MWST）,得到最大父节点数;然后利用蚁群算法（ACO）搜索最大支撑树,获得节点顺序;最后结合K2算法得到最优的贝叶斯网络结构。仿真实验结果表明,该方法不仅解决了K2算法依赖先验知识的问题,而且减少了蚁群算法的搜索空间,简化了搜索机制,得到较好的贝叶斯结构。最后将该算法应用到冀东水泥回转窑的实际数据中,构建水泥回转窑的贝叶斯网络结构,提高了故障诊断的准确率。

英文摘要：

K2 algorithm is the classical learning algorithm of Bayesian network structure. Aiming at the problems that K2 algorithm depends on the maximum number of parent nodes node order and ant colony optimization algorithm has large search space,this paper proposes a new Bayesian structure learning algorithm- MWST-ACO-K2 algorithm. Firstly,through calculating the mutual information,the algorithm establishes the Most Weight Supported Tree（ MWST） and obtain the maximum number of parent nodes. Secondly,ant colony optimization algorithm is adopted to search the Most Weight Supported Tree and obtain the node order. Finally,combining with K2 algorithm,the proposed algorithm can obtain the optimal Bayesian network structure. The simulation experiment results show that the proposed algorithm not only solves the problem that K2 algorithm relies on prior knowledge,but also reduces the search space of ant colony algorithm,simplifies the search mechanism and obtains good Bayesian structure. The proposed algorithm was applied to the operation data of the cement rotary kiln in Jidong Cement Company,established the Bayesian network structure model of the cement rotary kiln and achieved precise and rapid fault diagnosis.