Towards Linear Time Overlapping Community Detection in Social Networks

By Jierui Xie, Boleslaw K. Szymanski. Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2012

298 citations recorded by the source corpus.

Membership diversity is a characteristic aspect of social networks in which a person may belong to more than one social group. For this reason, discovering overlapping structures is necessary for realistic social analysis. In this paper, we present a fast algorithm, called SLPA, for overlapping community detection in large-scale networks. SLPA spreads labels according to dynamic interaction rules. It can be applied to both unipartite and bipartite networks. It is also able to uncover overlapping nested hierarchy . The time complexity of SLPA scales linearly with the number of edges in the network. Experiments in both synthetic and real-world networks show that SLPA has an excellent performance in identifying both node and community level overlapping structures.

Subfields: Computer Vision and Pattern Recognition, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/40aa83472207092f7cb40edc937490cb3a17c8b8

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Vision and Pattern Recognition

  1. Darko Hric
  2. Santo Fortunato
  3. Jia Wu
  4. Chuan Zhou
  5. Philip S. Yu
  6. Boleslaw K. Szymanski
  7. Cécile Paris
  8. Surya Nepal

In Statistical and Nonlinear Physics

  1. Darko Hric
  2. Boleslaw K. Szymanski
  3. Jierui Xie
  4. Santo Fortunato
  5. Philip S. Yu
  6. Stephen Kelley
  7. Chuan Zhou
  8. Jia Wu

Citations in the corpus