使用改进的微调策略改进社区结构检测
Improved community structure detection using a modified fine tuning strategy
摘要:
一个复杂网络的社区结构可以通过找到最大化模块性的节点划分来确定。许多提出的算法通过递归地平分网络来完成这项工作。我们发现,这不适当地限制了他们的结果,导致他们发现的社区的大小存在偏差,并限制了他们的有效性。为了解决这个问题,我们建议增加一个步骤,现有的算法,不增加其计算复杂性的顺序。我们表明,如果这一步是一个常用的方法相结合,所确定的约束和由此产生的偏见被删除,并提高其找到最佳分区的能力。该组合算法的有效性也被证明,通过使用它在现实世界的例子网络。对于这些例子中的一些,它实现了任何已知算法的最佳结果。
英文摘要:
The community structure of a complex network can be determined by finding the partitioning of its nodes that maximizes modularity. Many of the proposed algorithms for doing this work by recursively bisecting the network. We show that this unduely constrains their results, leading to a bias in the size of the communities they find and limiting their effectivness. To solve this problem, we propose adding a step to the existing algorithms that does not increase the order of their computational complexity. We show that, if this step is combined with a commonly used method, the identified constraint and resulting bias are removed, and its ability to find the optimal partitioning is improved. The effectiveness of this combined algorithm is also demonstrated by using it on real-world example networks. For a number of these examples, it achieves the best results of any known algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。