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

通过有效抽样有效地找到最大团摘要

Efficiently Finding a Maximal Clique Summary via Effective Sampling

Xiaofan Li, Rui Zhou, Lu Chen, Chengfei Liu, Qiang He, Yun Yang

摘要:

最大团枚举(MCE)是图论中的一个基本问题,被应用于许多应用中,例如社会网络分析、生物信息学、智能代理系统、网络安全等。大多数现有的MCE算法注重提高效率而不是减少输出大小。不幸的是,输出可能包含大量的最大团。在本文中,我们研究如何报告一个总结较少重叠的最大团。这问题以前曾作过研究,但在研究过先行的做法后,我们认为仍有不足之处。为了推进这方面的研究,本文尝试做了四个贡献:(a)我们提出了一个更有效的抽样策略,它产生了一个小得多的摘要,但仍然确保摘要可以以某种方式见证所有的最大集团,并确保每个最大集团的期望值超过一个预定义的阈值;(b)证明了在一定的最优性条件下,抽样策略是最优的,(c)应用样本大小界和设计新的计数序来逼近最优性条件;(d)为了进行实验验证,我们测试了八个具有各种图形特征的真实基准数据集。结果表明,我们的新采样策略始终优于最先进的方法,生成更小的摘要,并在所有数据集上运行更快。

英文摘要:

Maximal clique enumeration (MCE) is a fundamental problem in graph theory and is used in many applications, such as social network analysis, bioinformatics, intelligent agent systems, cyber security, etc. Most existing MCE algorithms focus on improving the efficiency rather than reducing the output size. The output unfortunately could consist of a large number of maximal cliques. In this paper, we study how to report a summary of less overlapping maximal cliques. The problem was studied before, however, after examining the pioneer approach, we consider it still not satisfactory. To advance the research along this line, our paper attempts to make four contributions: (a) we propose a more effective sampling strategy, which produces a much smaller summary but still ensures that the summary can somehow witness all the maximal cliques and the expectation of each maximal clique witnessed by the summary is above a predefined threshold; (b) we prove that the sampling strategy is optimal under certain optimality conditions; (c) we apply clique-size bounding and design new enumeration order to approach the optimality conditions; and (d) to verify experimentally, we test eight real benchmark datasets that have a variety of graph characteristics. The results show that our new sampling strategy consistently outperforms the state-of-the-art approach by producing smaller summaries and running faster on all the datasets.

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

↑