arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1206.3289cs.AI
收藏

持久动态贝叶斯网络的有效推理

Efficient inference in persistent Dynamic Bayesian Networks

Intel Research(英特尔研究院);University of Pittsburgh(匹兹堡大学)

Tomas Singliar, Denver Dash

摘要:

许多时间推理任务,如故障监视和异常检测,都表现出持久性:例如,如果某个东西坏了,它会一直坏下去,直到有人干预。当建模为动态贝叶斯网络时,持久性增加了相邻时间片之间的依赖关系,通常使用标准推理算法难以进行精确的时间推断。然而,我们表明,持久性意味着一个规则的结构,可以利用有效的推理。我们提出了三个连续的更一般的类模型:持久的因果链(PCC),持久的因果树(PCT)和持久的polytrees(PPT),以及相应的精确推理算法,利用持久性。我们表明,我们的算法的分析渐近界比较有利的连接树推理,我们证明经验,我们可以执行精确平滑的顺序上的100倍的速度比近似Boyen-Koller方法随机生成的持久树模型的实例。我们还展示了如何处理非持久性变量,以及如何有效地利用持久性进行近似过滤。

英文摘要:

Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an intervention. When modeled as a Dynamic Bayesian Network, persistence adds dependencies between adjacent time slices, often making exact inference over time intractable using standard inference algorithms. However, we show that persistence implies a regular structure that can be exploited for efficient inference. We present three successively more general classes of models: persistent causal chains (PCCs), persistent causal trees (PCTs) and persistent polytrees (PPTs), and the corresponding exact inference algorithms that exploit persistence. We show that analytic asymptotic bounds for our algorithms compare favorably to junction tree inference; and we demonstrate empirically that we can perform exact smoothing on the order of 100 times faster than the approximate Boyen-Koller method on randomly generated instances of persistent tree models. We also show how to handle non-persistent variables and how persistence can be exploited effectively for approximate filtering.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑