对弧进行删除的Bayes网络近似方法  

On Approximating Bayesian Networks by Removing Arcs

作　　者：岳博[1] 焦李成[1] 

机构地区：[1]西安电子科技大学雷达信号处理国家重点实验室,西安710071

出　　处：《计算机学报》2000年第11期1160-1165,共6页Chinese Journal of Computers

基　　金：国家"八六三"高技术研究发展计划!(86 3-317-0 3-0 5 -99)

摘　　要：弧的删除是一种对 Bayes网络模型进行近似的方法 .文中以 Kullback- L eibler偏差作为近似网络和原网络概率分布误差的测度 ,给出了近似网络在此测度意义下的最优参数 .同时 ,也给出了通过对原网络删除多条弧进行近似的启发式算法 ,当给定一个误差上界时 。As a knowledge representation framework and a kind of probability inference engine, Bayesian networks are widely used in applications for reasoning and decision making with inherent uncertainty. Since the exact algorithms of probability inference in Bayesian networks is NP-hard, as the topology of the network becomes more dense, the run-time complexity of probabilistic inference increases dramatically and real-time decision making eventually becomes prohibitive, so many approximate algorithms based on simulation or model simplification are proposed. The method discussed in this paper is based on the model simplification of arc removal. In this method, a subset of arcs are selected and removed, which simplifies the network structure and we obtain an approximate network, then any probability inference algorithm can be applied to this approximate network to get a solution within the error bound we predefined. By using the Kullback-Leibler information divergence as the measure of the difference between two probability distributions, this paper discusses the multiple arc removal problem in the gen eral case and presents the optimal parameters for the approximate network. Final ly, a heuristic algorithm is provided which searches a set of arcs to be removed under the upper bound on the probability error allowed.

关 键 词：BAYES网络 弧 删除 知识表示 概率推理 

分 类 号：O157.5[理学—数学] TP18[理学—基础数学]