arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.07945cs.LGcs.SImath.OC
收藏

局部超流扩散

Local Hyper-Flow Diffusion

University of Waterloo(滑铁卢大学);Purdue University(普渡大学)

Kimon Fountoulakis, Pan Li, Shenghao Yang

摘要:

最近,超图由于其能够捕捉实体之间的复杂关系而引起了人们的广泛关注。超图的兴起导致数据的规模和复杂性不断增加,表现出有趣的小规模和局部结构,例如,小规模社区和围绕给定种子节点集的本地化节点排名。捕获局部结构的流行和原则性方法是局部超图聚类问题和相关的种子集扩展问题。在这项工作中,我们提出了第一个局部扩散方法,实现边缘大小无关的Cheeger型保证的问题,局部超图聚类,同时适用于丰富的一类高阶关系,涵盖了许多以前研究的特殊情况。我们的方法是基于一个原始-对偶优化公式,其中原始问题有一个自然的网络流的解释,和对偶问题有一个基于切割的解释,使用相关的切割成本的$\ell_2$ -范数惩罚。我们证明了新技术在合成数据和真实数据上都明显优于最先进的方法。

英文摘要:

Recently, hypergraphs have attracted a lot of attention due to their ability to capture complex relations among entities. The insurgence of hypergraphs has resulted in data of increasing size and complexity that exhibit interesting small-scale and local structure, e.g., small-scale communities and localized node-ranking around a given set of seed nodes. Popular and principled ways to capture the local structure are the local hypergraph clustering problem and related seed set expansion problem. In this work, we propose the first local diffusion method that achieves edge-size-independent Cheeger-type guarantee for the problem of local hypergraph clustering while applying to a rich class of higher-order relations that covers many previously studied special cases. Our method is based on a primal-dual optimization formulation where the primal problem has a natural network flow interpretation, and the dual problem has a cut-based interpretation using the $\ell_2$-norm penalty on associated cut-costs. We demonstrate the new technique is significantly better than state-of-the-art methods on both synthetic and real-world data.

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

↑