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

从边缘约束求贝叶斯概率的多项式时间算法

A Polynomial Time Algorithm for Finding Bayesian Probabilities from Marginal Constraints

California Institute of Technology(加州理工学院)

J. W. Miller, R. M. Goodman

摘要:

本文提出了一种从边际约束系统中计算概率值的方法。以前的系统,用于找到一个单一的属性的概率,要么作出了独立的假设,有关的证据,或要求,在最坏的情况下,时间指数的系统的属性的数量。在本文中,一个封闭的形式解决方案的概率属性给定的证据被发现。封闭形式的解决方案,但不强制(非线性)的约束,所有的条款,在潜在的分布是积极的。该方程需要O(r^3)步来评估,其中r是评估时描述系统的独立边际约束的数量。此外,边际约束可以与新的约束交换,并且在O(r^2)步中计算新的解。该方法适用于实时的专家系统中的概率计算

英文摘要:

A method of calculating probability values from a system of marginal constraints is presented. Previous systems for finding the probability of a single attribute have either made an independence assumption concerning the evidence or have required, in the worst case, time exponential in the number of attributes of the system. In this paper a closed form solution to the probability of an attribute given the evidence is found. The closed form solution, however does not enforce the (non-linear) constraint that all terms in the underlying distribution be positive. The equation requires O(r^3) steps to evaluate, where r is the number of independent marginal constraints describing the system at the time of evaluation. Furthermore, a marginal constraint may be exchanged with a new constraint, and a new solution calculated in O(r^2) steps. This method is appropriate for calculating probabilities in a real time expert system

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

↑