基于三角形的重叠社团发现算法

社区结构是复杂网络的重要属性之一, 有效挖掘出复杂网络中隐藏的社区结构具有重要的理论研究意义和广泛的应用前景。真实网络在一定程度上都表现为重叠的社区结构, 针对这一问题, 提出了一种基于三角形的重叠社区发现算法。通过判断两个节点与其共享邻居节点能否构成一个三角形来判断, 若能构成三角形, 则这两个节点属于同一社区。在计算机生成网络与真实网络上进行了实验, 都正确地识别出了社区结构以及重叠节点, 表明了此算法对于发现重叠社区结构的有效性和可行性。

Overlapping community detection algorithm based on triangle

Community structure is an important property of complex networks, the ability to efficiently mine community structures from complex networks is fundamental for theoretical research and practical applications. In real world, networks all show the overlapping community structure to some extent. To address this issue, this paper gave an overlapping community discovery algorithm based on triangle. If two nodes and their shared neighbor nodes could constitute a triangle, the two nodes were considered in the same community. Experiments on the computer-generated and real networks, all identified the community structure and overlapping nodes correctly. It shows the algorithm is feasible and effective for detecting overlapping communities.