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

概率网络任意时间评估的状态空间抽象

State-space Abstraction for Anytime Evaluation of Probabilistic Networks

University of Michigan(密歇根大学)

Michael P. Wellman, Chao-Lin Liu

摘要:

决定评估概率网络的计算复杂性的一个重要因素是节点的状态空间的基数。通过改变状态空间的粒度,可以在结果的准确性与计算效率之间进行权衡。基于这一思想,我们提出了一个任意时刻的概率网络近似评估方法。在应用到一些简单的网络,该程序表现出一个平滑的近似质量的改善,随着计算时间的增加。这表明,状态空间抽象是一个更有用的控制参数设计实时概率推理机。

英文摘要:

One important factor determining the computational complexity of evaluating a probabilistic network is the cardinality of the state spaces of the nodes. By varying the granularity of the state spaces, one can trade off accuracy in the result for computational efficiency. We present an anytime procedure for approximate evaluation of probabilistic networks based on this idea. On application to some simple networks, the procedure exhibits a smooth improvement in approximation quality as computation time increases. This suggests that state-space abstraction is one more useful control parameter for designing real-time probabilistic reasoners.

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

↑