arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.11657math.STcs.ITmath.ITmath.PRstat.MLstat.TH
收藏

使用聚合相似性矩阵的多层超图聚类

Multilayer hypergraph clustering using the aggregate similarity matrix

Kalle Alaluusua, Konstantin Avrachenkov, B. R. Vinay Kumar, Lasse Leskelä

AI总结:

针对多层d-均匀HSBM的社群恢复问题,提出基于聚合超边计数相似性矩阵的SDP方法,并给出同配与异配情形下精确恢复的信息论参数条件。

摘要:

我们研究超图随机块模型(HSBM)的一种多层变体上的社群恢复问题。每一层对应于N个顶点上一个d-均匀HSBM的独立实现。给定一个相似性矩阵,其中包含与每对顶点关联的超边的聚合数量,目标是将N个顶点划分为互不相交的社群。在本工作中,我们研究一种半定规划(SDP)方法,并获得关于模型参数的信息论条件,这些条件保证在同配和异配两种情形下都能精确恢复。

英文摘要:

We consider the community recovery problem on a multilayer variant of the hypergraph stochastic block model (HSBM). Each layer is associated with an independent realization of a d-uniform HSBM on N vertices. Given the similarity matrix containing the aggregated number of hyperedges incident to each pair of vertices, the goal is to obtain a partition of the N vertices into disjoint communities. In this work, we investigate a semidefinite programming (SDP) approach and obtain information-theoretic conditions on the model parameters that guarantee exact recovery both in the assortative and the disassortative cases.

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

↑