Review on community detection algorithms in social networks

With the development of Internet and computer science, more and more people join social networks. People communicate with each other and express their opinions on the social media, which forms a complex network relationship. Individuals in the social networks form a “relation structure” through various connections which produces a large amount of information dissemination. This “relation structure” is the community that we are going to research. Community detection is very important to reveal the structure of social networks, dig to people's views, analyze the information dissemination and grasp as well as control the public sentiment. In recent years, with community detection becoming an important field of social networks analysis, a large number of academic literatures proposed numerous methods of community detection. In this paper, we first describe the concepts of social network, community, community detection and criterions of community quality. Then we classify the methods of community detection from three classes: i) traditional algorithms of community detection; ii) algorithms of overlapping community detection; iii) algorithms of local community detection. And at last, we summarize and discuss these methods as well as the potential future directions of community detection.

[1]  Jiawei Han,et al.  A probabilistic model for linking named entities in web text with heterogeneous information networks , 2014, SIGMOD Conference.

[2]  Boleslaw K. Szymanski,et al.  Overlapping community detection in networks: The state-of-the-art and comparative study , 2011, CSUR.

[3]  A. Clauset.  Finding local community structure in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  E A Leicht,et al.  Community structure in directed networks. , 2007, Physical review letters.

[5]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[6]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[7]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[8]  Yang Bo,et al.  Complex Network Clustering Algorithms , 2009 .

[9]  Xiao Fan Wang,et al.  Complex Networks: Topology, Dynamics and Synchronization , 2002, Int. J. Bifurc. Chaos.

[10]  Santo Fortunato,et al.  Community detection algorithms: a comparative analysis: invited presentation, extended abstract , 2009, VALUETOOLS.

[11]  A. Hoffman,et al.  Lower bounds for the partitioning of graphs , 1973 .

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

[13]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

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

[15]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

[16]  Jure Leskovec,et al.  Empirical comparison of algorithms for network community detection , 2010, WWW '10.

[17]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[18]  Jon M. Kleinberg,et al.  Community membership identification from small seed sets , 2014, KDD.

[19]  S. Borgatti,et al.  Analyzing Clique Overlap , 2009 .

[20]  Santo Fortunato,et al.  Finding Statistically Significant Communities in Networks , 2010, PloS one.

[21]  Tsuyoshi Murata,et al.  Community detection algorithm based on centrality and node distance in scale-free networks , 2013, HT.

[22]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

[23]  N. Metropolis,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2017 .

[24]  Gong Shang-f.  Survey on algorithms of community detection , 2013 .

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

[26]  Yiannis Kompatsiaris,et al.  Community detection in Social Media , 2012, Data Mining and Knowledge Discovery.

[27]  Richard M. Karp,et al.  Algorithms for graph partitioning on the planted partition model , 2001, Random Struct. Algorithms.

[28]  Inderjit S. Dhillon,et al.  Overlapping community detection using seed set expansion , 2013, CIKM.

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

[30]  Rik Sarkar,et al.  Community Detection , 2014, Encyclopedia of Machine Learning and Data Mining.

[31]  Charu C. Aggarwal,et al.  Social Network Data Analytics , 2011 .

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

[33]  Eric R. Ziegel,et al.  The Elements of Statistical Learning , 2003, Technometrics.

[34]  Steve Gregory,et al.  Finding overlapping communities in networks by label propagation , 2009, ArXiv.

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

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

[37]  Ruggero G. Pensa,et al.  Parameter-less co-clustering for star-structured heterogeneous data , 2012, Data Mining and Knowledge Discovery.

[38]  T. Vicsek,et al.  Clique percolation in random networks. , 2005, Physical review letters.

[39]  Celso Grebogi,et al.  International Journal of Bifurcation and Chaos: Editorial , 2008 .

[40]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

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