arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1205.2620cs.AIcs.DS
收藏

小空间贝叶斯网络的精确结构发现

Exact Structure Discovery in Bayesian Networks with Less Space

Helsinki Institute for Information Technology HIIT(赫尔辛基信息技术研究所 HIIT);University of Helsinki(赫尔辛基大学)

Pekka Parviainen, Mikko Koivisto

摘要:

贝叶斯网络中基于分数的结构发现的已知最快精确算法在时间和空间上运行2nnO(1)。这些算法的使用仅限于最多约25个节点上的网络,主要是由于空间要求。在这里,我们研究时空权衡,找到一个最佳的网络结构。当空间有限时,我们应用Gurevich-Shelah递推公式(最初是为Hamilton路径问题提出的),得到了在空间2snO(1)中的时间22 n-snO(1),其中s = n/2,n/4,n/8,. . .;我们假设每个节点的入度由一个常数限定。对于更实际的设置与适度的空间,我们提出了一个新的计划。它在空间2n(3/4)pnO(1)中产生运行时间2n(3/2)pnO(1),对任意p = 0,1,. . ., n/2;只要次数至多为0.238n,这些界限就成立。此外,后者的计划允许简单和有效的并行化超越以前的算法。我们还探索经验的潜力所提出的技术。

英文摘要:

The fastest known exact algorithms for scorebased structure discovery in Bayesian networks on n nodes run in time and space 2nnO(1). The usage of these algorithms is limited to networks on at most around 25 nodes mainly due to the space requirement. Here, we study space-time tradeoffs for finding an optimal network structure. When little space is available, we apply the Gurevich-Shelah recurrence-originally proposed for the Hamiltonian path problem-and obtain time 22n-snO(1) in space 2snO(1) for any s = n/2, n/4, n/8, . . .; we assume the indegree of each node is bounded by a constant. For the more practical setting with moderate amounts of space, we present a novel scheme. It yields running time 2n(3/2)pnO(1) in space 2n(3/4)pnO(1) for any p = 0, 1, . . ., n/2; these bounds hold as long as the indegrees are at most 0.238n. Furthermore, the latter scheme allows easy and efficient parallelization beyond previous algorithms. We also explore empirically the potential of the presented techniques.

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

↑