DetectingLinkCommunitiesinMassiveNetworks(通过边做社团发现).pdfVIP

2011 International Conference on Advances in Social Networks Analysis and Mining Detecting Link Communities in Massive Networks Qi Ye Bin Wu Zhixiong Zhao, Bai Wang School of Computer Science School of Computer Science School of Computer Science Beijing University of Posts Beijing University of Posts Beijing University of Posts and Telecommunications and Telecommunications and Telecommunications Beijing, China, 100876 Beijing, China, 100876 Beijing, China, 100876 Email: yeqibupt@ Email: wubin@ Email: zzxbupt@, wangbai@ Abstract鈥擬ost of the existing literature which has entirely II. RELATED WORK focused on clustering nodes in large-scale networks. To discover multi-scale overlapping communities quickly, we propose a highly Most of current community detection algorithms focus on ef铿乧ient multi-resolution link community detection algorithm to detect the link communities in massive networks based on the partition nodes into non-overlapping communities. However, idea of edge labeling. First, we will get the node partition of the current most widely used node partition approach has the the network based on a new multi-resolution node detection mainly drawback that nodes attributed to only one commu- algorithm. After that, we can 铿乶d the link community in a linear nity [1], [2], [3], [4]. While many real-world networks have time by the labels of nodes. Its time complexity is near linear and highly overlapping communities and many nodes may belong its space complexity is linear. The e