首页> 外文会议>Signal processing, sensor fusion, and target recognition XIX >Direct Message Passing for Hybrid Bayesian Networks and Performance Analysis
【24h】

Direct Message Passing for Hybrid Bayesian Networks and Performance Analysis

机译:混合贝叶斯网络的直接消息传递和性能分析

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

摘要

Probabilistic inference for hybrid Bayesian networks, which involves both discrete and continuous variables, has been an important research topic over the recent years. This is not only because a number of efficient inference algorithms have been developed and used maturely for simple types of networks such as pure discrete model, but also for the practical needs that continuous variables are inevitable in modeling complex systems. Pearl's message passing algorithm provides a simple framework to compute posterior distribution by propagating messages between nodes and can provides exact answer for polytree models with pure discrete or continuous variables. In addition, applying Pearl's message passing to network with loops usually converges and results in good approximation. However, for hybrid model, there is a need of a general message passing algorithm between different types of variables. In this paper, we develop a method called Direct Message Passing (DMP) for exchanging messages between discrete and continuous variables. Based on Pearl's algorithm, we derive formulae to compute messages for variables in various dependence relationships encoded in conditional probability distributions. Mixture of Gaussian is used to represent continuous messages, with the number of mixture components up to the size of the joint state space of all discrete parents. For polytree Conditional Linear Gaussian (CLG) Bayesian network, DMP has the same computational requirements and can provide exact solution as the one obtained by the Junction Tree (JT) algorithm. However, while JT can only work for the CLG model, DMP can be applied for general nonlinear, non-Gaussian hybrid model to produce approximate solution using unscented transformation and loopy propagation. Furthermore, we can scale the algorithm by restricting the number of mixture components in the messages. Empirically, we found that the approximation errors are relatively small especially for nodes that are far away from the discrete parent nodes. Numerical simulations show encouraging results.
机译:近年来,涉及离散和连续变量的混合贝叶斯网络的概率推论一直是重要的研究课题。这不仅是因为已经开发出许多有效的推理算法并将其成熟地用于诸如纯离散模型之类的简单类型的网络,而且还因为在对复杂系统建模时不可避免要使用连续变量的实际需求。 Pearl的消息传递算法提供了一个简单的框架,可以通过在节点之间传播消息来计算后验分布,并且可以为具有纯离散或连续变量的多树模型提供准确的答案。此外,将Pearl的消息传递应用于具有循环的网络通常会收敛并产生良好的近似。但是,对于混合模型,在不同类型的变量之间需要通用的消息传递算法。在本文中,我们开发了一种称为直接消息传递(DMP)的方法,用于在离散变量和连续变量之间交换消息。基于Pearl的算法,我们导出公式以计算条件概率分布中编码的各种依赖关系中变量的消息。高斯混合用于表示连续消息,混合分量的数量取决于所有离散父级的联合状态空间的大小。对于多树条件线性高斯(CLG)贝叶斯网络,DMP具有相同的计算要求,并且可以提供与结树(JT)算法获得的精确解决方案。但是,尽管JT仅适用于CLG模型,但DMP可以应用于一般的非线性,非高斯混合模型,以使用无味变换和循环传播来产生近似解。此外,我们可以通过限制消息中混合成分的数量来扩展算法。根据经验,我们发现近似误差相对较小,特别是对于远离离散父节点的节点。数值模拟显示令人鼓舞的结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号