CFP last date
22 April 2024
Reseach Article

Detecting Communities in Social Networks through Modularity Maximization

by Samridhi Khurana
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 182 - Number 5
Year of Publication: 2018
Authors: Samridhi Khurana
10.5120/ijca2018917553

Samridhi Khurana . Detecting Communities in Social Networks through Modularity Maximization. International Journal of Computer Applications. 182, 5 ( Jul 2018), 33-39. DOI=10.5120/ijca2018917553

@article{ 10.5120/ijca2018917553,
author = { Samridhi Khurana },
title = { Detecting Communities in Social Networks through Modularity Maximization },
journal = { International Journal of Computer Applications },
issue_date = { Jul 2018 },
volume = { 182 },
number = { 5 },
month = { Jul },
year = { 2018 },
issn = { 0975-8887 },
pages = { 33-39 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume182/number5/29761-2018917553/ },
doi = { 10.5120/ijca2018917553 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T01:10:29.981747+05:30
%A Samridhi Khurana
%T Detecting Communities in Social Networks through Modularity Maximization
%J International Journal of Computer Applications
%@ 0975-8887
%V 182
%N 5
%P 33-39
%D 2018
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Community structure in a network plays an important role in understanding its characteristics and functioning. In a social network, community structures represent closely knit groups of people, and are vital to understand and analyze the network as a whole. The network is described by a graph with nodes representing the entities and the edges representing connections between these entities. Very recent of community detection algorithms, is a method that relies on optimization of a parameter called modularity [1], which is an indication of the partition of a network into communities. Another significant article in this regard is [2] by Santo Fortunato and Marc Barth´elemy, which brings out that optimizing modularity on large networks fails to resolve small communities, even when they are well defined. In the present article, irregularities in the mathematical formulation of modularity are addressed and the author proposes an improvised procedure for community detection. The approach suggested is based on Modularity maximization but modified in the sense that the algorithm is applied in a recursive manner on the network until all sub-communities within the communities are identified. The improvised algorithm results in a better community structure with all distinct community structure clearly spelt out.

References
  1. B M. E. J. Newman and M. Girvan, Phys. Rev. E 69, 026113 (2004)
  2. Santo Fortunato and Marc Barthelemy (2007). "Resolution limit in community detection". Proceedings of the National Academy of Sciences of the United States of America
  3. G. W. Flake, S. Lawrence, C. Lee Giles and F. M. Coetzee, IEEE Computer 35(3), 66-71 (2002)
  4. M. Girvan and M. E. J. Newman, Proc. Natl. Acad. Sci. 99, 7821-7826 (2002)
  5. K. Eriksen, I. Simonsen, S. Maslov and K. Sneppen, Phys. Rev. Lett. 90, 148701 (2003)
  6. Blondel, V.; Guillaume, J.; Lambiotte, R; Lefebvre, E. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, IOP Publishing, 2008
  7. Stanford Large Network Dataset Collection: Epinions Social Network
  8. Stanford Large Network Dataset Collection: Wikipedia vote network
  9. van der Hofstad, Remco (2013). "Chapter 7". Random Graphs and Complex Networks (PDF)
Index Terms

Computer Science
Information Sciences

Keywords

Probability Estimate Recursive BGLL Qsingle Qpair