arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2105.08628cs.SIcs.DB
收藏

标号图上的蝶核社区搜索

Butterfly-Core Community Search over Labeled Graphs

Zheng Dong, Xin Huang, Guorui Yuan, Hengshu Zhu, Hui Xiong

摘要:

社区搜索的目的是在图中找到查询顶点的密集连接子图。虽然这一任务已经在文献中得到了广泛的研究,但大多数现有的作品只关注于寻找同质社区,而不是具有不同标签的异质社区。在本文中,我们提出了一个新的问题,跨组社区搜索,即蝴蝶核心社区(BCC),在一个标记的图,其中每个顶点有一个标签表示其属性和两个顶点之间的边表示它们的交叉关系。具体来说,对于两个查询顶点具有不同的标签,我们的目标是找到一个密集连接的交叉社区,包含两个查询顶点,并由蝴蝶网络,其中每个翅膀的蝴蝶是由一个k-核心搜索的基础上,一个查询顶点和两个翅膀连接这些蝴蝶。事实上,BCC结构允许结构的内聚性和最小直径,从而可以有效地捕获异构和简洁的协作团队。此外,我们从理论上证明了该问题是NP-困难的,并分析了它的不可逼近性。为了有效地解决这个问题,我们开发了一个启发式算法,它首先找到一个BCC包含查询顶点,然后迭代地删除最远的顶点从图中的查询顶点。该算法可以达到最优解的2-近似。为了进一步提高效率,我们设计了一个蝴蝶核索引,并开发了一套有效的算法来识别和维护蝴蝶核的顶点被删除。八个真实世界的网络和四个新的案例研究的广泛实验验证了我们的算法的有效性和效率。

英文摘要:

Community search aims at finding densely connected subgraphs for query vertices in a graph. While this task has been studied widely in the literature, most of the existing works only focus on finding homogeneous communities rather than heterogeneous communities with different labels. In this paper, we motivate a new problem of cross-group community search, namely Butterfly-Core Community (BCC), over a labeled graph, where each vertex has a label indicating its properties and an edge between two vertices indicates their cross relationship. Specifically, for two query vertices with different labels, we aim to find a densely connected cross community that contains two query vertices and consists of butterfly networks, where each wing of the butterflies is induced by a k-core search based on one query vertex and two wings are connected by these butterflies. Indeed, the BCC structure admits the structure cohesiveness and minimum diameter, and thus can effectively capture the heterogeneous and concise collaborative team. Moreover, we theoretically prove this problem is NP-hard and analyze its non-approximability. To efficiently tackle the problem, we develop a heuristic algorithm, which first finds a BCC containing the query vertices, then iteratively removes the farthest vertices to the query vertices from the graph. The algorithm can achieve a 2-approximation to the optimal solution. To further improve the efficiency, we design a butterfly-core index and develop a suite of efficient algorithms for butterfly-core identification and maintenance as vertices are eliminated. Extensive experiments on eight real-world networks and four novel case studies validate the effectiveness and efficiency of our algorithms.

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

↑