• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Conference on Computer, Intelligent Computing and Education Technology >Answering multiple MAP queries simultaneously using binary jointree
【24h】

Answering multiple MAP queries simultaneously using binary jointree

机译：使用二进制文章回答多个MAP查询

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In a Bayesian Network (BN) modeled from a real system often contains several maximum a posteriori hypothesis (MAP) queries and each query corresponds to different MAP variables, which means that one can only solve these multiple queries one by one using variable elimination algorithm. Meanwhile, jointree algorithm is another kind of popular algorithm because it can answer multiple posterior probability queries only after an inward and outward calculation, and then one can extract solution to MAP query from the posterior probability distribution. However, the multiple queries which can be answered using jointree are constrained by the method of constructing the jointree. For now, there is not a formal method to construct a jointree that can answer multiple MAP queries simultaneously. This paper presents a new approach to construct a binary jointree that can answer multiple MAP queries simultaneously just after an inward and outward calculation, which is based on a method proposed by Shenoy, P. P. The paper analyzes the approach in detail and illustrates how to answer multiple MAP queries simultaneously using such a binary jointree. Finally the paper presents two cases to further discuss the method systematically.
机译：在从真实系统建模的贝贝内亚网络（BN）中，通常包含几个后验假设（MAP）查询，并且每个查询对应于不同的地图变量，这意味着一个可以使用可变消除算法逐个逐一解决这些多个查询。同时，教育算法是另一种流行算法，因为它只能在向内和向外计算之后回答多个后验概率查询，然后一个可以提取从后验概率分布地映射查询的解决方案。然而，可以使用教力回答的多个查询受到构建接合的方法的约束。目前，没有一个正式的方法来构建一个可以同时回答多个MAP查询的接合。本文介绍了构建一个新方法，可以构建二进制文章，该方法可以在内向和向外计算之后同时接听多个地图查询，这是基于Shenoy的方法，PP本文详细分析了方法，并说明了如何回答多个方法使用这样的二进制文章同时映射查询。最后，本文提出了两种情况，以进一步讨论该方法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号