arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.7416cs.AI
收藏

影响图中的概率推理

Probabilistic Inference in Influence Diagrams

Hong Kong University of Science & Technology(香港科技大学)

Nevin Lianwen Zhang

摘要:

本文将影响图(ID)评估简化为贝叶斯网络(BN)推理问题。这种简化是有趣的,因为它使人们能够容易地使用自己喜欢的BN推理算法来有效地评估ID。以前已经提出了两种这样的简化方法(Cooper 1988,Shachter and Peot 1992)。本文提出了一种新的方法。新方法所引起的BN推理问题比前两种方法所引起的BN推理问题容易解决得多。

英文摘要:

This paper is about reducing influence diagram (ID) evaluation into Bayesian network (BN) inference problems. Such reduction is interesting because it enables one to readily use one's favorite BN inference algorithm to efficiently evaluate IDs. Two such reduction methods have been proposed previously (Cooper 1988, Shachter and Peot 1992). This paper proposes a new method. The BN inference problems induced by the mew method are much easier to solve than those induced by the two previous methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑