Comparative Analysis of Community Discovery Methods in Social Networks

study of networks is an active area of research due to its capability of modeling many real world complex systems. Social Network gains its popularity due to its ease of use. It enables people all over the world to interact with each other with the advent of Web 2.0 in this Internet era. Online Social Networking facilitates people to have communication nevertheless of considering geographical location over the globe. Social Network Analysis is the field of research that provides a set of tools and theoretical approaches for holistic exploration of the communication and interaction patterns of social systems. A common pattern among the group of people in a network is considered as a community which is a partition of the entire network structure. There are few existing methods for discovering communities. We introduced a method called "mutual accessibility" for community discovery. This article compares such three different methods including the one that we introduced. The results of those methods are also shown by taking various datasets as an analysis.

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

[2]  Daling Wang,et al.  An Improved Spectral Clustering Algorithm for Community Discovery , 2009, 2009 Ninth International Conference on Hybrid Intelligent Systems.

[3]  Derek Greene,et al.  Community Finding in Large Social Networks Through Problem Decomposition , 2008 .

[4]  Tore Opsahl,et al.  Clustering in weighted networks , 2009, Soc. Networks.

[5]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[6]  Minas Gjoka,et al.  Walking in Facebook: A Case Study of Unbiased Sampling of OSNs , 2010, 2010 Proceedings IEEE INFOCOM.

[7]  E. Cooper,et al.  E. J. Will , 1985 .

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

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

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

[11]  Franck Picard,et al.  A mixture model for random graphs , 2008, Stat. Comput..

[12]  Jennifer Jie Xu,et al.  Mining communities and their relationships in blogs: A study of online hate groups , 2007, Int. J. Hum. Comput. Stud..

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

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

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

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

[17]  A. Arenas,et al.  Macro- and micro-structure of trust networks , 2002, cond-mat/0206240.

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

[19]  Clara Pizzuti,et al.  Community detection in social networks with genetic algorithms , 2008, GECCO '08.

[20]  J. Reichardt,et al.  Statistical mechanics of community detection. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  M. Mohamed Sathik,et al.  Discovering Communities in Social Networks Through Mutual Accessibility , 2010 .

[22]  Marco Furini,et al.  International Journal of Computer and Applications , 2010 .