计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (31): 27-29.DOI: 10.3778/j.issn.1002-8331.2009.31.009

• 研究、探讨 • 上一篇    下一篇

Credal网络推理的一种不完全枚举法

熊文涛1,2,齐 欢1,余胜平2   

  1. 1.华中科技大学 系统工程研究所,武汉430074
    2.孝感学院 数学系,湖北 孝感 432000
  • 收稿日期:2009-05-26 修回日期:2009-07-02 出版日期:2009-11-01 发布日期:2009-11-01
  • 通讯作者: 熊文涛

Inference in Credal networks through enumeration incompletely

XIONG Wen-tao1,2,QI Huan1,YU Sheng-ping2   

  1. 1.Institute of Systems Engineering,Huazhong University of Science & Technology,Wuhan 430074,China
    2.Department of Mathematics,Xiaogan University,Xiaogan,Hubei 432000,China
  • Received:2009-05-26 Revised:2009-07-02 Online:2009-11-01 Published:2009-11-01
  • Contact: XIONG Wen-tao

摘要: Credal网络是研究不确定环境下知识表示和因果推理的一种图模型,其条件概率值可以用不精确的区间或不等式定性地表示,使得表达方式更加灵活有效。Credal网络的推理是计算一定证据下的后验概率最大值和最小值,给出了一种Credal网络推理的新方法,该方法是在桶消元框架下通过枚举计算部分因子函数值,使计算量大大减小,并且可以得到精确的结果。最后用一个实例说明了该方法的可行性。

关键词: Credal网络, 贝叶斯网络, 桶消元, 枚举

Abstract: Credal network is one of the graphical tools for knowledge representation and reasoning under uncertain conditions,where probability values may be qualitatively expressed by intervals or inequality.The inference in Credal network is the computation of tight lower and upper bounds for conditional probabilities.A new algorithm for inference in Credal networks is presented based on the framework of bucket elimination.The burden of computation is alleviated by enumerating some of values and the accurate result is obtained.Finally an example is shown to illustrate the feasibility.

Key words: Credal networks, bayesian networks, bucket elimination, enumeration

中图分类号: