Discovering Communities in Social Networks Through Mutual Accessibility

Social network gains popularity due to its ease of use, as an application of Web 2.0 which facilitates users to communicate, interact and share on the World Wide Web. A Social network is a set of people or organizations or other social entities connected by a set of social relationships, such as friendship, co - working or information exchange. Social network analysis is the study of social networks to understand their structure and behavior. The study of networks is an active area of research due to its capability of modeling many real world complex systems. One such interesting property to investigate in any typical network is the community structure which is the division of networks into groups. Discovering communities in a social network environment is graph partitioning problem. None of the existing methods discussed about knowing the nodes of the network mutually. Hence, we propose a new approach called "mutual accessibility", to discover communities in a social network environment. We proved comparative study as results by taking both synthetic dataset and real datasets. There is a significant improvement in terms of accuracy and the number of communities discovered in the results obtained by this method.

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

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

[3]  Matthieu Latapy,et al.  Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..

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

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

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

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

[8]  Matthieu Latapy,et al.  Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..

[9]  Andrew Parker,et al.  The Hidden Power of Social Networks: Understanding How Work Really Gets Done in Organizations , 2004 .

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

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

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

[13]  Marjorie V. Batey,et al.  AUTHORS. IN PROFILE , 1969 .

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

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