An Improved Community Partition Algorithm Integrating Mutual Information

The research of community detection can help us analyze kinds of problems in social network, in which the research of community structure is very important. This paper proposes an improved algorithm: An Improved BGLL Integrating Mutual Information (BGLLi), which stabilizes modularity, meanwhile fuses the index of mutual information, so that we can find the optimal threshold of modularity and reduce the running time of community partition effectively. The dataset adopts the Twitter dataset and the public Arxiv dataset, and the related experimental results have verified the effectiveness of the algorithm

[1]  Bart Selman,et al.  Tracking evolving communities in large linked networks , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[3]  A. Barabasi,et al.  Quantifying social group evolution , 2007, Nature.

[4]  S Redner,et al.  Dynamics of social balance on networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[7]  P. Arabie,et al.  An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scaling , 1975 .

[8]  Tao Zhou,et al.  Link prediction in weighted networks: The role of weak ties , 2010 .

[9]  V. Latora,et al.  Harmony in the Small-World , 2000, cond-mat/0008357.

[10]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[12]  Jure Leskovec,et al.  Predicting positive and negative links in online social networks , 2010, WWW '10.

[13]  Jean-Loup Guillaume,et al.  Fast unfolding of community hierarchies in large networks , 2008, ArXiv.

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

[15]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[16]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[17]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[18]  Lada A. Adamic,et al.  How to search a social network , 2005, Soc. Networks.

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

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

[21]  Leon Danon,et al.  Comparing community structure identification , 2005, cond-mat/0505245.

[22]  Toyoaki Nishida,et al.  Analyzing concerns of people from Weblog articles , 2007, AI & SOCIETY.

[23]  Hua-Wei Shen,et al.  Community Structure of Complex Networks , 2013, Springer Theses.

[24]  E. Barnes.  An algorithm for partitioning the nodes of a graph , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

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

[26]  Hongkun Liu,et al.  Uncovering the network evolution mechanism by link prediction , 2011 .

[27]  Malik Magdon-Ismail,et al.  Finding communities by clustering a graph into overlapping subgraphs , 2005, IADIS AC.

[28]  Virgílio A. F. Almeida,et al.  A characterization of broadband user behavior and their e-business activities , 2004, PERV.

[29]  Wang Wen-qiang.  New Method of Assessing Network Evolving Models Based on Link Prediction , 2011 .

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

[31]  T. Vicsek,et al.  Weighted network modules , 2007, cond-mat/0703706.

[32]  C. Lee Giles,et al.  Efficient identification of Web communities , 2000, KDD '00.

[33]  V. Carchiolo,et al.  Extending the definition of modularity to directed graphs with overlapping communities , 2008, 0801.1647.

[34]  Fan Ying.  Community Structure in Complex Networks , 2008 .

[35]  Shihua Zhang,et al.  Identification of overlapping community structure in complex networks using fuzzy c-means clustering , 2007 .

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

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

[38]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .