Credal网络中使用单独指定的概率集进行推理
Inference with Seperately Specified Sets of Probabilities in Credal Networks
摘要：
我们提出了一种新的推理算法--有向无环图与概率集。Credal网络在这里被解释为编码变量之间的强独立关系。我们首先提出了一个理论的信用网络的基础上分别指定的概率集。我们还表明，推断与polytrees是NP-难在这种情况下。然后，我们介绍了新的技术，减少所需的计算量的推断，特别是在多树，探索可分性的credal集。
英文摘要：
We present new algorithms for inference in credal networks --- directed acyclic graphs associated with sets of probabilities. Credal networks are here interpreted as encoding strong independence relations among variables. We first present a theory of credal networks based on separately specified sets of probabilities. We also show that inference with polytrees is NP-hard in this setting. We then introduce new techniques that reduce the computational effort demanded by inference, particularly in polytrees, by exploring separability of credal sets.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
