基于SLPA优化的重叠社区发现算法

AN IMPROVED OVERLAPPING COMMUNITY DETECTION ALGORITHM BASED ON SLPA

传统的重叠社区发现算法SLPA虽然具有时间复杂度和性能上的优势,但标签传播算法内在的随机策略使得算法结果并不稳定。针对SLPA的缺点,提出一种高效稳定的重叠社区发现算法L-SLPA。先对网络进行非重叠划分,减少不同标签分配的数量,同时加入边界节点的考虑进行剪枝,以提高运行速度。实验结果表明,相比于SLPA,该算法在降低运行时间和随机性的同时保证了结果的准确性。

As a traditional overlapping community detection algorithm,SLPA has the advantages of time complexity and performance.However,its results are unstable due to the inherent random strategy of label propagation algorithm.For the purpose of addressing the shortcomings of SLPA,we propose an efficient and stable overlapping community detection algorithm L-SLPA.The network was preliminarily divided into non-overlapping communities to reduce the number of different label assignments.Meanwhile,we pruned the algorithm with the consideration of boundary nodes to improve the running speed of the algorithm.The experimental results show that compared with SLPA,L-SLPA reduces the running time and randomness while ensuring the accuracy of the results.