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

基本事件条件约束下的概率推断

Probabilistic Deduction with Conditional Constraints over Basic Events

T. Lukasiewicz

摘要:

研究了基本事件上带条件约束的概率演绎问题。我们证明了在基本事件上具有条件约束的全局完全概率演绎是NP-困难的。然后,我们集中在特殊情况下的概率推导条件约束树。我们阐述了非常有效的技术,全球完整的概率推导。详细地说,对于具有点概率的条件约束树,我们提出了一种全局完全概率推导的局部方法,该方法在条件约束树的大小上以线性时间运行。对于区间概率的条件约束树,我们证明了通过求解非线性规划,可以用全局方法进行全局完全概率推导。我们展示了如何将这些非线性规划转化为等价的线性规划,这些线性规划在多项式时间内可解。

英文摘要:

We study the problem of probabilistic deduction with conditional constraints over basic events. We show that globally complete probabilistic deduction with conditional constraints over basic events is NP-hard. We then concentrate on the special case of probabilistic deduction in conditional constraint trees. We elaborate very efficient techniques for globally complete probabilistic deduction. In detail, for conditional constraint trees with point probabilities, we present a local approach to globally complete probabilistic deduction, which runs in linear time in the size of the conditional constraint trees. For conditional constraint trees with interval probabilities, we show that globally complete probabilistic deduction can be done in a global approach by solving nonlinear programs. We show how these nonlinear programs can be transformed into equivalent linear programs, which are solvable in polynomial time in the size of the conditional constraint trees.

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

↑