A Constrained Optimization Method for Community Detection

Community detection is one of the most important problems in complex network research. In recent years, great efforts have been devoted to this problem in term of evaluating the resulting community structure. Our previous work has shown that in addition to the resolution limit of Q, both Q and D suffer from a more serious limitation, termed as extra weak community phenomenon, i.e. some derived communities do not satisfy even the weak community definition. In this paper, we provide a constrained optimization model to overcome extra weak community phenomenon. With an improved simulated annealing algorithm, we solve the constrained optimization model for both Q and D, and then use our new method in several practical community detection problems. The experimental results show that the new method can not only partition large networks into communities properly but also ensure that all resulting communities at least satisfy the weak community definition. In addition, we find that constrained optimization of Q finds fewer but large communities, while constrained optimization of D takes the network apart more detailed.

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

[2]  Rui-Sheng Wang,et al.  Optimization analysis of modularity measures for network community detection , 2008 .

[3]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[4]  Pablo M. Gleiser,et al.  Community Structure in Jazz , 2003, Adv. Complex Syst..

[5]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[6]  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.

[7]  Luonan Chen,et al.  Quantitative function for community detection. , 2008 .

[8]  A. Arenas,et al.  Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

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

[11]  Tiejun Li,et al.  Optimal partition and effective dynamics of complex networks , 2008, Proceedings of the National Academy of Sciences.

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

[13]  Xiang-Sun Zhang,et al.  Modularity optimization in community detection of complex networks , 2009 .

[14]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

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

[16]  C. Lee Giles,et al.  Self-Organization and Identification of Web Communities , 2002, Computer.

[17]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[18]  A Díaz-Guilera,et al.  Self-similar community structure in a network of human interactions. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.