arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2303.02813cs.SIcs.DL
收藏

真实世界与合成网络中的良连通社区

Well-Connected Communities in Real-World and Synthetic Networks

Minhyuk Park, Yasamin Tabatabaee, Vikram Ramavarapu, Baqiao Liu, Vidya Kamath Pailodi, Rajiv Ramachandran, Dmitriy Korobskiy, Fabio Ayres, George Chacko, Tandy Warnow

AI总结:

本文系统检验了五种主流社区检测方法,发现它们产生的社区普遍不满足良连通性要求,并提出连通性修正器(CM)通过迭代移除小边割和重新聚类来修复不连通社区,揭示了良连通性与覆盖率之间的权衡。

摘要:

通过图聚类检测社区这一问题的核心在于期望社区是“良连通的”。在这方面,我们考察了五种优化不同准则的社区检测方法:优化恒定波茨模型的Leiden算法、优化模块度的Leiden算法、迭代K核聚类(IKC)、Infomap和马尔可夫聚类(MCL)。令人惊讶的是,所有这些方法都在不同程度上产生了连一个温和的良连通性要求都无法满足的社区。为了修复不满足良连通性的聚类,我们开发了“连通性修正器”(CM),它以牺牲覆盖率为代价,迭代地移除小的边割并重新聚类,直到产生的所有社区都是良连通的。来自真实世界和合成网络的结果说明了用户在良连通聚类与覆盖率之间做出的权衡,并引发了关于网络的“可聚类性”以及社区结构模型的问题。

英文摘要:

Integral to the problem of detecting communities through graph clustering is the expectation that they are "well connected". In this respect, we examine five different community detection approaches optimizing different criteria: the Leiden algorithm optimizing the Constant Potts Model, the Leiden algorithm optimizing modularity, Iterative K-Core Clustering (IKC), Infomap, and Markov Clustering (MCL). Surprisingly, all these methods produce, to varying extents, communities that fail even a mild requirement for well connectedness. To remediate clusters that are not well connected, we have developed the "Connectivity Modifier" (CM), which, at the cost of coverage, iteratively removes small edge cuts and re-clusters until all communities produced are well connected. Results from real-world and synthetic networks illustrate a tradeoff users make between well connected clusters and coverage, and raise questions about the "clusterability" of networks and models of community structure.

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

↑