Skip to main content
SpringerLink
Log in

Community detection in dynamic networks: a comprehensive and comparative review using external and internal criteria

  • Review papers
  • Published:
International Journal of System Assurance Engineering and Management Aims and scope Submit manuscript

Abstract

Context: The world is experiencing a boom of data throughout several fields such as finance, engineering, medicine, crime and security etc. More and more problems associated with these fields are starting to be modeled using networks and dynamic and/or static graphs. This has led to further exploration of these graphs, their community structures and the associated community detection methods. Objective: This paper aims at studying a set of community detection approaches and analyzing their performance in terms of both external and internal criteria, including rand index, adjusted rand index, variation of information and normalized mutual information. Method: The chosen set of algorithms is thoroughly studied. Amongst this set, each algorithm is compared with the other in the set and the result is recorded numerically. These numerical values are recorded in a tabular format for better understanding of the reader. Each table is made specific to the criterion used to compare the algorithms. Altogether, a total of 4 tables are obtained for each of the metric used for the comparative analysis. Results: On comparing the algorithms with each other, the results are tabulated in a symmetric matrix whose values along the diagonal have an associated significance, which is described in the following sections. Conclusion: This paper presents a comparative analysis of the community detection algorithms against a set of external and internal criteria. Further, it lists some challenges faced by the research community in the study of these algorithms. The last section gives a summary of the common applications of community structure and detection methods.

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

Access this article

Log in via an institution

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

Similar content being viewed by others

References

  • Aghagolzadeh M, Soltanian-Zadeh H, Araabi B, Aghagolzadeh A (2007) A hierarchical clustering based on mutual information maximization. In: Image processing, 2007. ICIP 2007. IEEE international conference on, vol. 1, pp. I–277. IEEE

  • Akoglu L, Tong H, Koutra D (2015) Graph based anomaly detection and description: a survey. Data Mining Knowl Discovery 29(3):626–688

    Article  MathSciNet  Google Scholar 

  • Amer M, Goldstein M (2012) Nearest-neighbor and clustering based anomaly detection algorithms for rapidminer. In: Proceedings of the 3rd RapidMiner Community Meeting and Conference (RCOMM 2012), pp. 1–12

  • Arab M, Afsharchi M (2012) A modularity maximization algorithm for community detection in social networks with low time complexity. In: Proceedings of the The 2012 IEEE/WIC/ACM international joint conferences on web intelligence and intelligent agent technology-Volume 01, pp. 480–487. IEEE Computer Society

  • Bakillah M, Li RY, Liang SH (2015) Geo-located community detection in twitter with enhanced fast-greedy optimization of modularity: the case study of typhoon haiyan. Int J Geogr Inf Sci 29(2):258–279

    Article  Google Scholar 

  • Bassett DS, Porter MA, Wymbs NF, Grafton ST, Carlson JM, Mucha PJ (2013) Robust detection of dynamic community structure in networks. Chaos: An Interdiscip J Nonlinear Sci 23(1):013,142

    Article  MathSciNet  Google Scholar 

  • Bechtel JJ, Kelley WA, Coons TA, Klein MG, Slagel DD, Petty TL (2005) Lung cancer detection in patients with airflow obstruction identified in a primary care outpatient practice. Chest 127(4):1140–1145

    Google Scholar 

  • Bhuyan MH, Bhattacharyya DK, Kalita JK (2014) Network anomaly detection: methods, systems and tools. IEEE Commun Surv Tutorials 16(1):303–336

    Article  Google Scholar 

  • Blondel VD, Guillaume JL, Lambiotte R (2008) Fast unfolding of communities in large networks. J Stat Mech: Theory Exp 10:P10,008

    Article  MATH  Google Scholar 

  • Brandes U, Delling D, Gaertler M, Görke R, Hoefer M, Nikoloski Z, Wagner D (2007) On finding graph clusterings with maximum modularity. In: International workshop on graph-theoretic concepts in computer science, pp. 121–132. Springer

  • Cahill ND (2010) Normalized measures of mutual information with general definitions of entropy for multimodal image registration. In: International workshop on biomedical image registration, pp. 258–268. Springer

  • Campello RJ (2007) A fuzzy extension of the rand index and other related indexes for clustering and classification assessment. Pattern Recogn Lett 28(7):833–841

    Article  Google Scholar 

  • Chen J, Zhang H, Guan ZH, Li T (2012) Epidemic spreading on networks with overlapping community structure. Phys A: Stat Mech Its Appl 391(4):1848–1854

    Article  Google Scholar 

  • Chen J, Zaïane OR, Goebel R (2009) Detecting communities in social networks using max-min modularity. In: Proceedings of the 2009 SIAM international conference on data mining, pp. 978–989. SIAM

  • Chintalapudi SR, Prasad MK (2015) A survey on community detection algorithms in large scale real world networks. In: Computing for Sustainable Global Development (INDIACom), 2015 2nd International conference on, pp. 1323–1327. IEEE

  • course.ccs.neu.edu locality cluster. https://course.ccs.neu.edu/cs6140sp15/7_locality_cluster/ (2015)

  • Csardi G, Nepusz T (2006) The igraph software package for complex network research. Inter J Complex Syst 1695(5):1–9

    Google Scholar 

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

  • Danon L, Diaz-Guilera A, Duch J, Arenas A (2005) Comparing community structure identification. J Stat Mech: Theory Exp 09:P09,008

    MATH  Google Scholar 

  • Dhouioui Z, Akaichi J (2013) Overlapping community detection in social networks. In: Bioinformatics and biomedicine (BIBM), 2013 IEEE international conference on, pp. 17–23. IEEE

  • Ding S, Du M, Sun T, Xu X, Xue Y (2017) An entropy-based density peaks clustering algorithm for mixed type data employing fuzzy neighborhood. Knowl-Based Syst 133:294–313

    Article  Google Scholar 

  • Dinh TN, Xuan Y, Thai MT (2009) Towards social-aware routing in dynamic communication networks. In: Performance computing and communications conference (IPCCC), 2009 IEEE 28th international, pp. 161–168. IEEE

  • Du M, Ding S, Xue Y (2017) A novel density peaks clustering algorithm for mixed data. Pattern Recogn Lett 97:46–53

    Article  Google Scholar 

  • Eaton E, Mansbach R (2012) A spin-glass model for semi-supervised community detection. In Proceedings of the twenty-sixth AAAI conference on artificial intelligence, Vol. 26. No. 1., pp 900–906

  • Enugala R, Rajamani L, Kurapati S, Kadampur MA, Devi YR (2018) Detecting communities in dynamic social networks using modularity ensembles som. Inter J Rough Sets Data Anal (IJRSDA) 5(1):34–43

    Article  Google Scholar 

  • Fortunato S (2010) Community detection in graphs. Phys Rep 486(3–5):75–174

    Article  MathSciNet  Google Scholar 

  • Fortunato S, Hric D (2016) Community detection in networks: a user guide. Phys Rep 659:1–44

    Article  MathSciNet  Google Scholar 

  • Gangopadhyay A, Chen S (2016) Health care fraud detection with community detection algorithms. In: Smart Computing (SMARTCOMP), 2016 IEEE international conference on, pp. 1–5. IEEE

  • Garcia JO, Ashourvan A, Muldoon S, Vettel JM, Bassett DS (2018) Applications of community detection techniques to brain graphs: algorithmic considerations and implications for neural function. Proc IEEE 106(5):846–867

    Article  Google Scholar 

  • Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Nat Acad Sci 99(12):7821–7826

    Article  MathSciNet  MATH  Google Scholar 

  • Gregory S (2007) An algorithm to find overlapping community structure in networks. In: European conference on principles of data mining and knowledge discovery, pp. 91–102. Springer

  • Gulbahce N, Lehmann S (2008) The art of community detection. BioEssays 30(10):934–938

    Article  Google Scholar 

  • Harenberg S, Bello G, Gjeltema L, Ranshous S, Harlalka J, Seay R, Padmanabhan K, Samatova N (2014) Community detection in large-scale networks: a survey and empirical evaluation. Wiley Interdiscip Rev: Comput Stat 6(6):426–439

    Article  Google Scholar 

  • Hawkins DM (1980) Identification of outliers, vol. 11. Springer

  • Hric D, Darst RK, Fortunato S (2014) Community detection in networks: Structural communities versus ground truth. Phys Rev E 90(6):062

    Article  Google Scholar 

  • Hullermeier E, Rifqi M (2009) A fuzzy variant of the rand index for comparing clustering structures. In: Joint 2009 International Fuzzy Systems Association World Congress and 2009 European Society of Fuzzy Logic and Technology Conference, IFSA-EUSFLAT 2009, pp. 1294–1298

  • Ismail S, Ismail R (2017) Modularity approach for community detection in complex networks. In: Proceedings of the 11th international conference on ubiquitous information management and communication, p. 56. ACM

  • Jin D, Yang B, Baquero C, Liu D, He D, Liu J (2011) A markov random walk under constraint for discovering overlapping communities in complex networks. J Stat Mech: Theory Exp 05:P05,031

    MATH  Google Scholar 

  • Kawamura H, Taniguchi T (2015) Chapter 1 - spin glasses. In: K. Buschow (ed.) Handbook of magnetic materials, vol. 24, pp. 1 – 137. Elsevier. https://doi.org/10.1016/bs.hmm.2015.08.001

  • KONECT Zachary karate club. http://konect.uni-koblenz.de/networks/ucidata-zachary (2017)

  • Krieger AM, Green PE (1999) A generalized rand-index method for consensus clustering of separate partitions of the same data base. J Classif 16(1):63–89

    Article  Google Scholar 

  • Kumar R, Novak J, Raghavan P, Tomkins A (2005) On the bursty evolution of blogspace. World Wide Web 8(2):159–178

    Article  Google Scholar 

  • Lai D, Lu H, Nardini C (2010) Enhanced modularity-based community detection by random walk network preprocessing. Phys Rev E 81(6):066,118

    Article  Google Scholar 

  • Lancichinetti A, Fortunato S (2009) Community detection algorithms: a comparative analysis. Phys Rev E 80(5):056,117

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Le Martelot E, Hankin C (2012) Multi-scale community detection using stability optimisation within greedy algorithms. arXiv preprint arXiv:1201.3307

  • Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, pp. 177–187. ACM

  • Leskovec J, Lang KJ, Mahoney M (2010) Empirical comparison of algorithms for network community detection. In: Proceedings of the 19th international conference on World wide web, pp. 631–640. ACM

  • Lin S, Hu Q, Wang G, Philip SY (2015) Understanding community effects on information diffusion. In: Pacific-Asia conference on knowledge discovery and data mining, pp. 82–95. Springer

  • Liu J, Bier E, Wilson A, Guerra-Gomez JA, Honda T, Sricharan K, Gilpin L, Davies D (2016) Graph analysis for detecting fraud, waste, and abuse in healthcare data. AI Magazine 37(2):33–46

    Article  Google Scholar 

  • Lu J, Wu D, Mao M, Wang W, Zhang G (2015) Recommender system application developments: a survey. Decis Support Syst 74:12–32

    Article  Google Scholar 

  • Luo T, Zhong C, Ying X, Fu J (2011) Detecting community structure based on edge betweenness. In: Fuzzy systems and knowledge discovery (FSKD), 2011 eighth international conference on, vol. 2, pp. 1133–1136. IEEE

  • Malliaros FD, Vazirgiannis M (2013) Clustering and community detection in directed networks: a survey. Phys Rep 533(4):95–142

    Article  MathSciNet  MATH  Google Scholar 

  • Manning CD, Raghavan P, Schütze H (2008) Introduction to information retrieval. Cambridge University Press, New York

    Book  MATH  Google Scholar 

  • Meilă M (2003) Comparing clusterings by the variation of information. In: Learning theory and kernel machines, pp. 173–187. Springer

  • Meilă M (2007) Comparing clusterings–an information based distance. J Multivar Anal 98(5):873–895

    Article  MathSciNet  MATH  Google Scholar 

  • Mukkamala S, Janoski G, Sung A (2002) Intrusion detection using neural networks and support vector machines. In: Neural Networks, 2002. IJCNN’02. Proceedings of the 2002 international joint conference on, vol. 2, pp. 1702–1707. IEEE

  • Newman ME (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69(6):066,133

    Article  Google Scholar 

  • Newman ME (2004) Detecting community structure in networks. Eur Phys J B 38(2):321–330

    Article  Google Scholar 

  • Newman ME (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):036,104

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  • Nieves JF, Jiao YC (2009) Data clustering for anomaly detection in network intrusion detection. Research Alliance in Math and Science pp. 1–12

  • Noble CC, Cook DJ (2003) Graph-based anomaly detection. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 631–636. ACM

  • Orman GK, Labatut V (2012) Cherifi H (2012) Comparative evaluation of community detection algorithms: a topological approach. J Stat Mech: Theory Exp 08:P08,001

    Google Scholar 

  • Pan WF, Jiang B, Li B (2013) Refactoring software packages via community detection in complex software networks. Int J Autom Comput 10(2):157–166

    Article  Google Scholar 

  • Pan L, Wang C, Xie J (2013) A spin-glass model based local community detection method in social networks. In: 2013 IEEE 25th international conference on tools with artificial intelligence, pp. 108–115. IEEE

  • Papadopoulos S, Kompatsiaris Y, Vakali A, Spyridonos P (2012) Community detection in social media. Data Mining Knowl Discovery 24(3):515–554

    Article  Google Scholar 

  • Pinheiro CAR (2012) Community detection to identify fraud events in telecommunications networks. SAS SUGI proceedings: customer intelligence

  • Pinney JW, Westhead DR (2006) Betweenness-based decomposition methods for social and biological networks. Interdiscip Stat Bioinform 25:87–90

    Google Scholar 

  • Pons P (2007) Détection de communautés dans les grands graphes de terrain. Ph.D. thesis, Paris 7

  • Pons P, Latapy M (2006) Computing communities in large networks using random walks. J Graph Algorithms Appl 10(2):191–218

    Article  MathSciNet  MATH  Google Scholar 

  • Pons P, Latapy M (2005) Computing communities in large networks using random walks. In: International symposium on computer and information sciences, pp. 284–293. Springer

  • Porter MA, Onnela JP, Mucha PJ (2009) Communities in networks. Notices of the AMS 56(9):1082–1097

    MathSciNet  MATH  Google Scholar 

  • Portnoy L (2000) Intrusion detection with unlabeled data using clustering. Ph.D. thesis, Columbia University

  • Radicchi F (2013) Detectability of communities in heterogeneous networks. Phys Rev E 88(1):010,801

    Article  MathSciNet  Google Scholar 

  • Rand WM (1971) Objective criteria for the evaluation of clustering methods. J Am Stat Assoc 66(336):846–850

    Article  Google Scholar 

  • Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc National Acad Sci 105(4):1118–1123

    Article  Google Scholar 

  • Ruan J, Zhang W (2007) An efficient spectral algorithm for network community discovery and its applications to biological and social networks. In: Data Mining, 2007. ICDM 2007. Seventh IEEE international conference on, pp. 643–648. IEEE

  • Salathé M, Jones JH (2010) Dynamics and control of diseases in networks with community structure. PLoS Comput Biol 6(4):e1000,736

    Article  MathSciNet  Google Scholar 

  • Samatova NF, Hendrix W, Jenkins J, Padmanabhan K, Chakraborty A (2013) Practical graph mining with R. CRC Press

  • Santos JM, Embrechts M (2009) On the use of the adjusted rand index as a metric for evaluating supervised classification. In: International conference on artificial neural networks, pp. 175–184. Springer

  • Sherrington D, Kirkpatrick S (1975) Solvable model of a spin-glass. Phys Rev Lett 35(26):1792

    Article  Google Scholar 

  • Shiga M, Takigawa I, Mamitsuka H (2007) A spectral clustering approach to optimally combining numericalvectors with a modular network. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 647–656. ACM

  • Steinwart I, Hush D, Scovel C (2005) A classification framework for anomaly detection. J Mach Learn Res 6(Feb):211–232

    MathSciNet  MATH  Google Scholar 

  • Sun J, Faloutsos C, Faloutsos C, Papadimitriou S, Yu PS (2007) Graphscope: parameter-free mining of large time-evolving graphs. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 687–696. ACM

  • Tan F, Xia Y, Zhu B (2014) Link prediction in complex networks: a mutual information perspective. PloS One 9(9):e107,056

    Article  Google Scholar 

  • Toyoda M, Kitsuregawa M (2003) Extracting evolution of web communities from a series of web archives. In: Proceedings of the fourteenth ACM conference on Hypertext and hypermedia, pp. 28–37. ACM

  • trends.google.com (2012) Google Trends. http://trends.google.com/trends [Online; accessed 19-July-2008]

  • Valverde-Rebaza JC, de Andrade Lopes A (2012) Link prediction in complex networks based on cluster information. In: Advances in artificial intelligence-SBIA 2012, pp. 92–101. Springer

  • Wang Y, Cong G, Song G, Xie K (2010) Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 1039–1048. ACM

  • Waskiewicz T (2012) Friend of a friend influence in terrorist social networks. In: Proceedings on the International Conference on Artificial Intelligence (ICAI), p. 1. The steering committee of the world congress in computer science, Computer \(\ldots\)

  • White S, Smyth P (2005) A spectral clustering approach to finding communities in graphs. In: Proceedings of the 2005 SIAM international conference on data mining, pp. 274–285. SIAM

  • Xie J, Kelley S, Szymanski BK (2013) Overlapping community detection in networks: The state-of-the-art and comparative study. ACM Comput Surv (csur) 45(4):43

    Article  MATH  Google Scholar 

  • Yang Z, Algesheimer R, Tessone CJ (2016) A comparative analysis of community detection algorithms on artificial networks. Sci Rep 6(30):750

    Google Scholar 

  • Yang B, Liu D, Liu J (2010) Discovering communities from social networks: methodologies and applications. In: Handbook of social network technologies and applications, pp. 331–346. Springer

  • Yang H, Xie F, Lu Y (2006) Clustering and classification based anomaly detection. In: International conference on fuzzy systems and knowledge discovery, pp. 1082–1091. Springer

  • Yeung KY, Ruzzo WL (2001) Details of the adjusted rand index and clustering algorithms, supplement to the paper an empirical study on principal component analysis for clustering gene expression data. Bioinformatics 17(9):763–774

    Article  Google Scholar 

  • Zanin M, Cano P, Buldú JM, Celma O (2008) Complex networks in recommendation systems. In: Proc. 2nd WSEAS International Conference on Computer Engineering and Applications, World Scientific Advanced Series In Electrical And Computer Engineering. Acapulco, Mexico: World Scientific Advanced Series In Electrical And Computer Engineering, pp. 120–124. Citeseer

  • Zhang Y (2018) Community detection methods using eigenvectors of matrices. netwiki.amath.unc.edu. http://netwiki.amath.unc.edu/uploads/Publications/Ma11Paper_final.pdf

Download references

Author information

Authors and Affiliations

  1. School of Information Systems and Management, Heinz College, Carnegie Mellon University, Pittsburgh, 15213, USA

    Namika Makhija

  2. School of Computer Science and Engineering, Vellore Institute of Technology, Vellore, Tamil Nadu, 632014, India

    Shashank Mouli Satapathy

Authors
  1. Namika Makhija
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shashank Mouli Satapathy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shashank Mouli Satapathy.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Makhija, N., Satapathy, S.M. Community detection in dynamic networks: a comprehensive and comparative review using external and internal criteria. Int J Syst Assur Eng Manag 12, 217–230 (2021). https://doi.org/10.1007/s13198-020-01048-w

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13198-020-01048-w

Keywords

Search

Navigation