arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2011.07683cs.LGstat.ML
收藏

基于张量特征值分解的超图划分

Hypergraph Partitioning using Tensor Eigenvalue Decomposition

Indian Institute of Technology Madras(马德拉斯印度理工学院)

Deepak Maurya, Balaraman Ravindran

摘要:

超图在机器学习领域获得了越来越多的关注,因为超图在捕捉实体间的超二元交互方面优于图。在这项工作中,我们提出了一种新的方法划分的k-一致超图。大多数现有方法的工作原理是将超图简化为一个图,然后应用标准的图划分算法。约简步骤限制了算法仅捕获一些加权的成对相互作用,因此丢失了关于原始超图的基本信息。我们克服了这个问题,利用基于张量的超图表示,这使我们能够捕捉实际的超并元相互作用。证明了超图到图的约化是张量压缩的一个特例。我们将最小比率割和归一化割的概念从图推广到超图,并证明了松弛优化问题等价于张量特征值分解。这种新的公式也使我们能够捕捉不同的方式切割超边缘,不同于现有的减少方法。我们提出了一个超图分割算法的灵感来自谱图理论,可以容纳这个概念的超边削减。我们还得到了一个更严格的上限的最小正特征值的偶数阶超图Laplacian张量的电导,这是利用在分区算法来近似归一化割。所提出的方法的有效性证明了简单超图的数值。我们还表明,2-均匀超图(图)的最小切割解决方案的标准谱分割算法的改进。

英文摘要:

Hypergraphs have gained increasing attention in the machine learning community lately due to their superiority over graphs in capturing super-dyadic interactions among entities. In this work, we propose a novel approach for the partitioning of k-uniform hypergraphs. Most of the existing methods work by reducing the hypergraph to a graph followed by applying standard graph partitioning algorithms. The reduction step restricts the algorithms to capturing only some weighted pairwise interactions and hence loses essential information about the original hypergraph. We overcome this issue by utilizing the tensor-based representation of hypergraphs, which enables us to capture actual super-dyadic interactions. We prove that the hypergraph to graph reduction is a special case of tensor contraction. We extend the notion of minimum ratio-cut and normalized-cut from graphs to hypergraphs and show the relaxed optimization problem is equivalent to tensor eigenvalue decomposition. This novel formulation also enables us to capture different ways of cutting a hyperedge, unlike the existing reduction approaches. We propose a hypergraph partitioning algorithm inspired from spectral graph theory that can accommodate this notion of hyperedge cuts. We also derive a tighter upper bound on the minimum positive eigenvalue of even-order hypergraph Laplacian tensor in terms of its conductance, which is utilized in the partitioning algorithm to approximate the normalized cut. The efficacy of the proposed method is demonstrated numerically on simple hypergraphs. We also show improvement for the min-cut solution on 2-uniform hypergraphs (graphs) over the standard spectral partitioning algorithm.

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

↑