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

混合贝叶斯网络模型中分区表达式的堆叠分解

Stacking Factorizing Partitioned Expressions in Hybrid Bayesian Network Models

Capital University of Economics and Business(首都经济贸易大学);Queen Mary, University of London(伦敦玛丽女王大学)

Peng Lin, Martin Neil, Norman Fenton

AI总结:

针对混合贝叶斯网络中分区表达式CPD规模随父节点指数增长的问题,本文提出堆叠分解(SF)算法,通过中间节点逐步重建密度以限制连续父节点数量,并与二元分解(BF)结合显著减小CPD规模、降低树宽并提升推理效率。

摘要:

混合贝叶斯网络(HBN)包含复杂的条件概率分布(CPD),这些分布以离散变量和连续变量上的分区表达式形式指定。当使用离散推理时,这些CPD的大小随父节点数量呈指数增长,导致显著的效率低下。通常,减小CPD规模的一种有效方法是使用二元分解(BF)算法,通过将相连父节点的数量分解为大小为二的集合来分解CPD中的统计函数或算术函数。然而,BF算法并非为处理分区表达式而设计。因此,我们提出一种名为堆叠分解(SF)的新算法来分解分区表达式。SF算法创建中间节点以逐步重建原始分区表达式中的密度,使得在生成的HBN中每个子节点最多连接两个连续父节点。SF既可以独立使用,也可以与BF算法结合使用。我们表明,SF+BF算法显著减小了CPD规模,并有助于降低模型的树宽,从而提高效率。

英文摘要:

Hybrid Bayesian networks (HBN) contain complex conditional probabilistic distributions (CPD) specified as partitioned expressions over discrete and continuous variables. The size of these CPDs grows exponentially with the number of parent nodes when using discrete inference, resulting in significant inefficiency. Normally, an effective way to reduce the CPD size is to use a binary factorization (BF) algorithm to decompose the statistical or arithmetic functions in the CPD by factorizing the number of connected parent nodes to sets of size two. However, the BF algorithm was not designed to handle partitioned expressions. Hence, we propose a new algorithm called stacking factorization (SF) to decompose the partitioned expressions. The SF algorithm creates intermediate nodes to incrementally reconstruct the densities in the original partitioned expression, allowing no more than two continuous parent nodes to be connected to each child node in the resulting HBN. SF can be either used independently or combined with the BF algorithm. We show that the SF+BF algorithm significantly reduces the CPD size and contributes to lowering the tree-width of a model, thus improving efficiency.

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

↑