期刊文献+

融合先验信息的贝叶斯网络结构学习方法 被引量:12

Structure learning method of Bayesian network with prior information
下载PDF
导出
摘要 在贝叶斯网络结构学习的过程中,如何采集先验信息并合理利用它对于构建准确的网络结构非常重要。鉴于此,依据有先验信息的贝叶斯网络结构学习的三个环节:先验信息的采集、先验信息的融合和网络结构的优化,首先讨论了现有先验信息获取方法的不足,并提出了基于信念图的先验信息获取方法;其次针对所获取的先验信息通常具有一定的不确性,对最小描述长度测度进行了改进以融合非确定性先验信息;最后依据问题特性对模拟退火算法进行了适当的修改以更好地优化网络结构。实验表明,提出的结构学习方法能够有效地提高网络结构的学习精度。 In the process of Bayesian network structure learning, how to gather prior information and use it effectively are very important for building an exact network structure. Therefore, according to the three stages of Bayesian network structure learning with prior information: information gathering, information fusion and the optimization of learned network structure. Firstly, the deficiency of currently available methods that is used for obtaining prior information is discussed, and then a new method of gathering prior structure information based on so-called belief map is proposed. Secondly, the minimum description length score is modified so that it can fuse uncertain prior information. Finaly, a simulated annealing method is revised appropriately according to the characteristics of the problem for searching the optimal structure. Experimental results show that the proposed method can improve the precision of structure learning efficiently.
出处 《系统工程与电子技术》 EI CSCD 北大核心 2012年第12期2585-2591,共7页 Systems Engineering and Electronics
基金 国家自然科学基金(61074107 91024015)资助课题
关键词 贝叶斯网络 结构学习 信念图 非确定性先验信息 模拟退火 最小描述长度 Bayesian network structure learning belief map uncertain prior information simulated annealing minimum description length
  • 相关文献

参考文献21

  • 1Rooa T, Silander T, Kontkanen P, et al. Bayesian network structure learning using factorized NML universal models[C]// Proc. of the Information Theory and Applications Workshop, 2008:272- 276.
  • 2王中锋,王志海,付彬.一种局部打分搜索型限制性贝叶斯网络结构学习算法[J].南京大学学报(自然科学版),2009,45(5):656-664. 被引量:5
  • 3Scutari M, Brogini A. Bayesian Network structure learning with permutation tests[EB/OL].[2011 - 07 - 27]. http://arxiv. org/PS_cache/arxiv/pdf/1101/1101. 5184v2. pdf.
  • 4Tsamardinos I, Brown L F,Aliferis C F. The max-rain hillclimb- ing BN structure learning agorithm [J]. Machine Learning, 2006, 65(1):31-78.
  • 5Liu F, Tian F Z, Zhu Q L. A novel greedy Bayesian network structure learning algorithm for limited data[C]//Proc, of the 3rd International Conference on Advanced Data Mining and Applications, 2007: 412- 421.
  • 6Pinto P C, Nagele A, Dejori M, et al. Learning of Bayesian net- works by a local discovery ant colony algorithm[C]//Proc, of the IEEE World Congress on Computational Intelligence, 2008, 2741 - 2748.
  • 7Daly R, Shen Q, Learning Bayesian network equivalence classes with ant colony optimization[J]. Journal of Artificial Intelli- gence Research, 2009,35 (1) : 391 - 447.
  • 8Cao W D, Fang X N. An improved method for Bayesian network structure learning[C]//Proc, of the 6th International Confer- ence on Natural Computation, 2010: 3133 - 3137.
  • 9Heckerman D, Geiger D, Chickering D M. Learning Bayesian net- works: the combination of knowledge and statistical data[J]. Ma- chine Learning, 1995, 20(3) : 197 - 243.
  • 10Wellman M P, Breese J S, Goldman R P. From knowledge ba- ses to decision models[J]. Knowledge Engineering Review , 1992, 7(1): 35-53.

二级参考文献72

共引文献159

同被引文献118

引证文献12

二级引证文献81

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部