Detecting Link Communities in Massive Networks

摘要

Most of the existing literature which has entirely focused on clustering nodes in large-scale networks. To discover multi-scale overlapping communities quickly, we propose a highly efficient multi-resolution link community detection algorithm to detect the link communities in massive networks based on the idea of edge labeling. First, we will get the node partition of the network based on a new multi-resolution node detection algorithm. After that, we can find the link community in a linear time by the labels of nodes. Its time complexity is near linear and its space complexity is linear. The effectiveness of our algorithm is demonstrated by extensive experiments on lots of computer generated artificial graphs and real-world networks. The results show that our algorithm is very fast and highly reliable. Tests on real and artificial networks also give excellent results comparing with the newly proposed link partition algorithm.