Link Communities Detection via Local Approach

The traditional community detection algorithms were always focusing on the node community, while some recent studies have shown great advantage of link community approach which partitions links instead of nodes into communities. Here, we proposed a novel algorithm LBLC (local based link community) to detect link communities in networks based on some local information. A local link community can be detected by maximizing a local link fitness function from a seed link, which was ranked by another algorithm previously. The proposed LBLC algorithm has been tested on both synthetic and real world networks. The experimental results showed LBLC achieves meaningful link community structure.

[1]  T. S. Evans,et al.  Clique graphs and overlapping communities , 2010, ArXiv.

[2]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[3]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  R. Lambiotte,et al.  Line graphs, link partitions, and overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Neil J. Hurley,et al.  Detecting Highly Overlapping Communities with Model-Based Overlapping Seed Expansion , 2010, 2010 International Conference on Advances in Social Networks Analysis and Mining.

[6]  Fergal Reid,et al.  Detecting highly overlapping community structure by greedy clique expansion , 2010, KDD 2010.

[7]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[8]  Mao-Bin Hu,et al.  Detect overlapping and hierarchical community structure in networks , 2008, ArXiv.

[9]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

[10]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  David Lusseau,et al.  The emergent properties of a dolphin social network , 2003, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[13]  R. Guimerà,et al.  Functional cartography of complex metabolic networks , 2005, Nature.

[14]  Mark E. J. Newman,et al.  An efficient and principled method for detecting communities in networks , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Andrea Lancichinetti,et al.  Community detection algorithms: a comparative analysis: invited presentation, extended abstract , 2009, VALUETOOLS.

[16]  Sune Lehmann,et al.  Link communities reveal multiscale complexity in networks , 2009, Nature.

[17]  Alexander Struck,et al.  Identification of overlapping communities and their hierarchy by locally calculating community-changing resolution levels , 2010, ArXiv.

[18]  Mark E. J. Newman,et al.  Stochastic blockmodels and community structure in networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Claudio Castellano,et al.  Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[20]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[21]  Youngdo Kim,et al.  Map equation for link communities. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.