可分解图中的子聚类与变长连接树
Sub-clustering in decomposable graphs and size-varying junction trees
摘要:
提出了一种基于半潜在树依赖二部图的可分解图表示方法。这种新颖的表现形式有两个主要的好处。首先,它在图的最大集团内实现了一种形式的子聚类,为可分解图的一般使用增加了信息丰富性,这些可分解图可以在具有行为类型数据的应用程序中利用。其次,它允许一个新的节点驱动的马尔可夫链蒙特卡罗采样器的可分解的图形,可以很容易地并行化和规模。建议的采样器也受益于可分解图的基于连接树的采样器的计算效率。
英文摘要:
This paper proposes a novel representation of decomposable graphs based on semi-latent tree-dependent bipartite graphs. The novel representation has two main benefits. First, it enables a form of sub-clustering within maximal cliques of the graph, adding informational richness to the general use of decomposable graphs that could be harnessed in applications with behavioural type of data. Second, it allows for a new node-driven Markov chain Monte Carlo sampler of decomposable graphs that can easily parallelize and scale. The proposed sampler also benefits from the computational efficiency of junction-tree-based samplers of decomposable graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。