首页> 外文会议>AAAI Conference on Artificial Intelligence >Latent Tree Models and Approximate Inference in Bayesian Networks
【24h】

Latent Tree Models and Approximate Inference in Bayesian Networks

机译:久坐树模型和贝叶斯网络的近似推断

获取原文
获取外文期刊封面目录资料

摘要

We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and when online, make inference with the LTM instead of the original BN. Because LTMs are tree-structured, inference takes linear time. In the meantime, they can represent complex relationship among leaf nodes and hence the approximation accuracy is often good. Empirical evidence shows that our method can achieve good approximation accuracy at low online computational cost.
机译:我们提出了一种用于贝叶斯网络(BNS)的近似推断的新方法。该想法是从BN中抽样数据,从下行中获取潜在的树模型(LTM),并且在线时,对LTM而不是原始BN进行推断。因为LTMS是树结构的,所以推断需要线性时间。与此同时,它们可以代表叶节点之间的复杂关系,因此近似精度通常是良好的。经验证据表明,我们的方法可以以低在线计算成本实现良好的近似精度。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号