首页> 外文期刊>Artificial intelligence >Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
【24h】

Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks

机译:定向路径单连通贝叶斯网络中概率推理的复杂性

获取原文
获取原文并翻译 | 示例
           

摘要

Directed-path (DP) singly-connected Bayesian networks are an interesting special case that, in particular, includes both polytrees and two-level networks. We analyze the computational complexity of these networks. The prediction problem is shown to be easy, as standard message passing can perform correct updating. However, diagnostic reasoning is hard even for DP singly-connected networks. In addition, finding the most-probable explanation (MPE) is hard, even without evidence. Finally, complexity of nearly DP singly-connected networks is analyzed.
机译:定向路径(DP)单连接贝叶斯网络是一个有趣的特殊情况,特别是同时包含多叉树和两级网络。我们分析了这些网络的计算复杂性。由于标准消息传递可以执行正确的更新,因此预测问题显示很容易。但是,即使对于DP单独连接的网络,诊断推理也很困难。此外,即使没有证据,也很难找到最有可能的解释(MPE)。最后,分析了近DP单连接网络的复杂性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号