arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1303.1495cs.AI
收藏

信度网络中寻找MPE的一种有效方法

An efficient approach for finding the MPE in belief networks

Oregon State University(俄勒冈州立大学)

Zhaoyu Li, Bruce D'Ambrosio

摘要:

给定一个有证据的信念网络,在信念网络中找到I个最可能的解释(MPE)的任务是识别和排序信念网络的非证据节点的I个最可能的实例。虽然已经提出了许多方法来解决这个问题,但大多数方法仅适用于受限的拓扑结构(即,单连接信念网络)。在本文中,我们将提出一种新的方法来寻找在任意信念网络中的IMPEs。首先,我们将提出一个算法,在信念网络中找到MPE。然后,我们将提出一个线性时间算法,找到第一个MPE后,找到下一个MPE。最后,我们将讨论的问题,找到一个信念网络的变量子集的MPE,并表明该问题可以有效地解决这种方法。

英文摘要:

Given a belief network with evidence, the task of finding the I most probable explanations (MPE) in the belief network is that of identifying and ordering the I most probable instantiations of the non-evidence nodes of the belief network. Although many approaches have been proposed for solving this problem, most work only for restricted topologies (i.e., singly connected belief networks). In this paper, we will present a new approach for finding I MPEs in an arbitrary belief network. First, we will present an algorithm for finding the MPE in a belief network. Then, we will present a linear time algorithm for finding the next MPE after finding the first MPE. And finally, we will discuss the problem of finding the MPE for a subset of variables of a belief network, and show that the problem can be efficiently solved by this approach.

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

↑