arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1302.4939cs.AI
收藏

因果网络中精确和近似推理的条件化方法

Conditioning Methods for Exact and Approximate Inference in Causal Networks

Rockwell Science Center(罗克韦尔科学中心)

Adnan Darwiche

摘要:

我们提出了因果网络中精确和近似推理的两种算法。第一个算法,动态条件,是一个改进的割集条件,具有线性复杂性的一些网络,其中割集条件是指数。第二个算法,B-条件,是一个算法的近似推理,允许一个折衷的质量近似计算时间。我们还提出了一些实验结果说明所提出的算法的性能。

英文摘要:

We present two algorithms for exact and approximate inference in causal networks. The first algorithm, dynamic conditioning, is a refinement of cutset conditioning that has linear complexity on some networks for which cutset conditioning is exponential. The second algorithm, B-conditioning, is an algorithm for approximate inference that allows one to trade-off the quality of approximations with the computation time. We also present some experimental results illustrating the properties of the proposed algorithms.

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

↑