Skip to main content
Springer Nature Link
Log in

A self-organized approach for detecting communities in networks

  • Original Article
  • Published:
Social Network Analysis and Mining Aims and scope Submit manuscript

Abstract

The community structure of networks reveals hidden information about the whole network structure that cannot be discerned using other topological properties. Yet, the importance of identifying community structure in networks to many fields such as medicine, social sciences and national security, calls for better approaches for performing the identification. The prevalent community detection algorithms utilize a centralized approach that is unlikely to scale to very large networks and does not handle dynamic networks. We propose a self-organized approach to community detection which utilizes a newly introduced concept of node entropy to allow individual nodes to make decentralized and independent decisions concerning the community to which they belong; we call our approach Self- O rganized C ommunity I dentification AL gorithm ( SOCIAL ). Node entropy is a mathematical expression of an individual node’s satisfaction with its current community. As nodes become more “satisfied”, i.e., entropy is low, the community structure of a network is emergent. Our algorithm offers several advantages over existing algorithms including near-linear performance, identification of partial community overlaps, and handling of dynamic changes in the network in a local manner.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  • Adomavicius G, Tuzhilin A (2005) Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. IEEE Trans. Knowl. Data Eng 17(6):734–749

    Article  Google Scholar 

  • Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008(10):P10008

  • Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6):66111. doi:10.1103/PhysRevE.70.066111

    Google Scholar 

  • Cruz JD, Bothorel C, Poulet F (2011) Entropy based community detection in augmented social networks. In: 2011 International Conference on computational aspects of social networks (CASoN), 19–21 October 2011, pp 163–168

  • Csardi G, Nepusz T (2006) The igraph software package for complex network research. Int J Complex Systems 1695. http://igraph.sf.net

  • Fortunato S (2010) Community detection in graphs. Physics Reports 486:75–174

    Article  MathSciNet  Google Scholar 

  • Fortunato S, Barthélemy M (2007) Resolution limit in community detection. PNAS 104:36

    Google Scholar 

  • Girvan M, Newman M.E.J (2002) Community structure in social and biological networks. PNAS 99(12):7821–7826

    Article  MathSciNet  MATH  Google Scholar 

  • Gregory S (2010) Finding overlapping communities in networks by label propagation. New J Phys 12(10):103018

    Google Scholar 

  • Java A, Song X, Finin T, Tseng B (2007) Why we twitter: understanding microblogging usage and communities. In: Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis, WebKDD/SNA-KDD ’07. ACM, New York, NY, pp 56–65

  • Valdis Krebs (2002) Mapping networks of terrorist cells. Connections 24(3):43–52

    Google Scholar 

  • Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110

    Google Scholar 

  • Ma X, Gao L, Yong X (2010) Eigenspaces of networks reveal the overlapping and hierarchical community structure more precisely. J Stat Mec Theory Exp 2010(08):P08012

  • Marco Mamei, Ronaldo Menezes, Robert Tolksdorf, Franco Zambonelli (2006) Case studies for self-organization in computer science. J. Syst. Archit 52(8):443–460

    Article  Google Scholar 

  • Newman M EJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113

    Google Scholar 

  • Huazhong Ning, Wei Xu, Yun Chi, Yihong Gong, Thomas S. Huang (2010) Incremental spectral clustering by efficiently updating the eigen-system. Pattern Recogn 43(1):113–127

    Article  MATH  Google Scholar 

  • Gergely Palla, Imre Derenyi, Illes Farkas, Tamás Vicsek (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814–818

    Article  Google Scholar 

  • Troy Raeder, Nitesh V. Chawla (2011) Market basket analysis with networks. Social Netw. Analys. Mining 1(2):97–113

    Article  Google Scholar 

  • Raghavan UN, Albert R, Kumara S (2007) Near inear time algorithm to detect community structures in large-scale networks. arXiv 76(3):036106

    Google Scholar 

  • Rattigan MJ, Maier M, Jensen D (2007) Graph clustering with network structure indices. In: Proceedings of the 24th international conference on machine learning, ICML ’07. ACM, New York, NY, pp 783–790

  • Rees BS, Gallagher KB (2012) Overlapping community detection using a community optimized graph swarm. Soc Netw Anal Min 2(4):405–417

    Google Scholar 

  • Reichardt J, Bornholdt S (2004) Detecting fuzzy community structures in complex networks with a potts model. Phys Rev Lett 93(21):218701

    Google Scholar 

  • John Scott (2011) Social network analysis: developments, advances, and prospects. Social Network Analysis and Mining 1(1):21–26

    Article  Google Scholar 

  • Claude Shannon, Noshirwan Petigara, Satwiksai Seshasai (1978) A mathematical theory of communication. Bell System Technical Journal 27:379–423

    Article  MATH  Google Scholar 

  • Shi J, Malik J (1997) Normalized cuts and image segmentation. In: Proceedings of the 1997 conference on computer vision and pattern recognition (CVPR ’97), CVPR ’97. IEEE Computer Society, Washington, DC, p 731

  • Venugopal S, Stoner E, Cadeiras M, Menezes R (2012) The social structure of organ transplantation in the united states. In: Proceedings of the 3rd international workshop on complex networks (CompleNet 2012), vol 424 of studies in computational intelligence. Springer-Verlag, Melbourne, FL, pp 199–206

  • Wilkinson DM, Huberman BA (2004) A method for finding communities of related genes. Proc Natl Acad Sci 101(Suppl 1):5241–5248. doi:10.1073/pnas.0307740100

    Google Scholar 

  • Xie J, Chen M, Szymanski BK (May 2013) LabelRankT: incremental community detection in dynamic networks via label propagation

  • Zachary WW (1977) An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33:452–473

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Sciences BioComplex Laboratory, Florida Institute of Technology, Melbourne, FL, USA

    Ben Collingsworth & Ronaldo Menezes

Authors
  1. Ben Collingsworth
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Ronaldo Menezes
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Ronaldo Menezes.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Collingsworth, B., Menezes, R. A self-organized approach for detecting communities in networks. Soc. Netw. Anal. Min. 4, 169 (2014). https://doi.org/10.1007/s13278-014-0169-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s13278-014-0169-5

Keywords