Journal of Northeastern University Natural Science ›› 2015, Vol. 36 ›› Issue (11): 1543-1547.DOI: 10.12068/j.issn.1005-3026.2015.11.006

• Information & Control • Previous Articles     Next Articles

A Graph Compression Based Overlapping Communities Detection Algorithm

ZHAO Yu-hai, YIN Ying, WANG Xue   

  1. School of Information Science & Engineering, Northeastern University, Shenyang 110819, China.
  • Received:2015-03-30 Revised:2015-03-30 Online:2015-11-15 Published:2015-11-10
  • Contact: ZHAO Yu-hai
  • About author:-
  • Supported by:
    -

Abstract: To improve the capacity of single machine to handle complex network,overlapping communities detection algorithm was proposed. First, a graph compression based social network model, namely agglomerative graph, was introduced, which was a lossless compression to the original network. Then, inspired by the idea of iteration based on seeds, the selected seeds were expanded to the communities by optimizing the proposed community fitness function iteratively. Finally, the communities of high similarity with each other were merged to get the final results. Since the scale of the network to be dealt is significantly reduced, and some redundant computations are avoided, the proposed algorithm is of high efficiency.

Key words: overlapping community, social network, data mining, clustering, graph compression

CLC Number: