Skip to main content
SpringerLink
Log in

A ground truth contest between modularity maximization and modularity density maximization

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript

Abstract

Computational techniques for network clustering identification are critical to several application domains. Recently, Modularity Maximization and Modularity Density Maximization have become two of the main techniques that provide computational methods to identify network clusterings. Therefore, understanding their differences and common characteristics is fundamental to decide which one is best suited for a given application. Several heuristics and exact methods have been developed for both Modularity Maximization and Modularity Density Maximization problems. Unfortunately, no structured methodological comparison between the two techniques has been proposed yet. This paper reports a ground truth contest between both optimization problems. We do so aiming to compare their exact solutions and the results of heuristics inspired in these problems. In our analysis, we use branch-and-price exact methods which apply the best-known column generation procedures. The heuristic methods obtain the highest objective function scores and find solutions for networks with hundreds of thousands of nodes. Our experiments suggest that Modularity Density Maximization yields the best results over the tested networks. The experiments also show the behavior and importance of the quantitative factor of the Modularity Density Maximization objective function.

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

Similar content being viewed by others

Notes

  1. A homeless node is one that does not have a cluster assigned to it.

References

  • Agarwal G, Kempe D (2008) Modularity-maximizing graph communities via mathematical programming. Eur Phys J B 66(3):409–418

    MathSciNet  MATH  Google Scholar 

  • Aloise D, Cafieri S, Caporossi G, Hansen P, Perron S, Liberti L (2010) Column generation algorithms for exact modularity maximization in networks. Phys Rev E 82(4):046112

    Google Scholar 

  • Aloise D, Caporossi G, Hansen P, Liberti L, Perron S, Ruiz M (2013) Modularity maximization in networks by variable neighborhood search. In: Bader DA, Meyerhenke H, Sanders P, Wagner D (eds) Contemporary mathematics, chap graph partitioning and graph clustering, vol 588. American Mathematical Society, Providence, pp 113–127

    Google Scholar 

  • Amelio A, Pizzuti C (2015) Is normalized mutual information a fair measure for comparing community detection methods? In: Proceedings of the 2015 IEEE/ACM international conference on advances in social networks analysis and mining 2015—ASONAM ’15 pp 1584–1585

  • Arenas A, Fernandez A, Gomez S (2008) Analysis of the structure of complex networks at different resolution levels. New J Phys 10(053039):0703218

    Google Scholar 

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

    MATH  Google Scholar 

  • Brandes U, Delling D, Gaertler M, Gorke R, Hoefer M, Nikoloski Z, Wagner D (2008) On modularity clustering. IEEE Trans Knowl Data Eng 20(2):172–188

    MATH  Google Scholar 

  • Cafieri S, Hansen P, Liberti L (2010) Loops and multiple edges in modularity maximization of networks. Phys Rev E Stat Nonlinear Soft Matter Phys 81(4 Pt 2):046102

    MathSciNet  Google Scholar 

  • Calderoni F, Brunetto D, Piccardi C (2017) Communities in criminal networks: a case study. Soc Netw 48:116–125

    Google Scholar 

  • Chakraborty T, Srinivasan S, Ganguly N, Bhowmick S, Mukherjee A (2013) Constant communities in complex networks. Sci Rep 3:1825

    Google Scholar 

  • Chen M, Nguyen T, Szymanski BK (2013) On measuring the quality of a network community structure. In: International conference on social computing (SocialCom), 2013. IEEE, Alexandria, pp 122–127

  • Chen M, Kuzmin K, Szymanski BK (2014) Community detection via maximization of modularity and its variants. IEEE Trans Comput Soc Syst 1(1):46–65

    Google Scholar 

  • Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6):066111-1–066111-6

    Google Scholar 

  • Costa A (2015) MILP formulations for the modularity density maximization problem. Eur J Oper Res 245(1):14–21

    MathSciNet  MATH  Google Scholar 

  • Costa A, Kushnarev S, Liberti L, Sun Z (2016) Divisive heuristic for modularity density maximization. Comput Oper Res 71:100–109

    MathSciNet  MATH  Google Scholar 

  • Darst RK, Nussinov Z, Fortunato S (2014) Improving the performance of algorithms to find communities in networks. Phys Rev E 89(3):032809

    Google Scholar 

  • De Meo P, Ferrara E, Fiumara G, Provetti A (2013) Enhancing community detection using a network weighting strategy. Inf Sci 222:648–668

    MathSciNet  MATH  Google Scholar 

  • De Meo P, Ferrara E, Fiumara G, Provetti A (2014) Mixing local and global information for community detection in large networks. J Comput Syst Sci 80(1):72–87

    MathSciNet  MATH  Google Scholar 

  • Djidjev HN, Onus M (2013) Scalable and accurate graph clustering and community structure detection. IEEE Trans Parallel Distrib Syst 24(5):1022–1029

    MATH  Google Scholar 

  • Ferrara E, De Meo P, Catanese S, Fiumara G (2014) Detecting criminal organizations in mobile phone networks. Expert Syst Appl 41(13):5733–5750

    Google Scholar 

  • Fortunato S, Barthélemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci USA 104(1):36–41

    Google Scholar 

  • Fortunato S, Hric D (2016) Community detection in networks: a user guide. Phys Rep 659:1–44. https://doi.org/10.1016/j.physrep.2016.09.002

    Article  MathSciNet  Google Scholar 

  • Gong M, Cai Q, Li Y, Ma J, (2012) An improved memetic algorithm for community detection in complex networks. In: 2012 IEEE congress on evolutionary computation. IEEE, Brisbane, pp 1–8

  • Granell C, Gómez S, Arenas A (2012) Hierarchical multiresolution method to overcome the resolution limit in complex networks. Int J Bifurc Chaos 22(07):1250171-1–1250171-7

    Google Scholar 

  • Guimera R, Amaral L (2005) Functional cartography of complex metabolic networks. Nature 433(February):895–900

    Google Scholar 

  • Hric D, Darst RK, Fortunato S (2014) Community detection in networks: structural communities versus ground truth. Phys Rev E Stat Nonlinear Soft Matter Phys 90(6):062805. https://doi.org/10.1103/PhysRevE.90.062805

    Article  Google Scholar 

  • IBM (2015) IBM ILOG CPLEX Optimization Studio V12.6.3 documentation. IBM

  • Izunaga Y, Matsui T, Yamamoto Y (2016) A doubly nonnegative relaxation for modularity density maximization. Technical Report 1339, University of Tsukuba, Tsukuba

  • Jarukasemratana S, Murata T (2014) Edge weight method for community detection in scale-free networks. In: Proceedings of the 4th international conference on web intelligence, mining and semantics, vol 1(c), pp 1–9

  • Javed MA, Younis MS, Latif S, Qadir J, Baig A (2018) Community detection in networks: a multidisciplinary review. J Netw Comput Appl 108(February):87–111. https://doi.org/10.1016/j.jnca.2018.02.011

    Article  Google Scholar 

  • Jia S, Gao L, Gao Y, Wang H (2014) Anti-triangle centrality-based community detection in complex networks. IET Syst Biol 8(3):116–25

    Google Scholar 

  • Jiang JQ, McQuay LJ (2012) Modularity functions maximization with nonnegative relaxation facilitates community detection in networks. Physica A 391(3):854–865 1103.4072

    Google Scholar 

  • Karimi-Majd AM, Fathian M, Amiri B (2014) A hybrid artificial immune network for detecting communities in complex networks. Computing 97(5):483–507

    MathSciNet  MATH  Google Scholar 

  • Krzakala F, Moore C, Mossel E, Neeman J, Sly A, Zdeborová L, Zhang P (2013) Spectral redemption in clustering sparse networks. Proc Nat Acad Sci USA 110(52):20935–40

    MathSciNet  MATH  Google Scholar 

  • Lancichinetti A, Fortunato S (2012) Consensus clustering in complex networks. Sci Rep 2:336

    Google Scholar 

  • Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E Stat Nonlinear Soft Matter Phys 78(4):1–6 0805.4770

    Google Scholar 

  • Lancichinetti A, Radicchi F, Ramasco JJ, Fortunato S (2011) Finding statistically significant communities in networks. PLoS ONE 6(4):e18961

    Google Scholar 

  • Li Z, Zhang S, Wang RS, Zhang XS, Chen L (2008) Quantitative function for community detection. Phys Rev E 77(3):036109

    Google Scholar 

  • Liu J, Zeng J (2010) Community detection based on modularity density and genetic algorithm. In: Proceedings of international conference on computational aspects of social networks, Taiyuan, pp 29–32

  • Liu X, Wang W, He D, Jiao P, Jin D, Cannistraci CV (2017) Semi-supervised community detection based on non-negative matrix factorization with node popularity. Inf Sci 381:304–321. https://doi.org/10.1016/j.ins.2016.11.028

    Article  Google Scholar 

  • Matthews BW (1975) Comparison of the predicted and observed secondary structure of T4 phage lysozyme. BBA Protein Struct 405(2):442–451

    Google Scholar 

  • Meunier D, Fonlupt P, Saive AL, Plailly J, Ravel N, Royet JP (2014) Modular structure of functional networks in olfactory memory. NeuroImage 95:264–75

    Google Scholar 

  • Muff S, Rao F, Caflisch A (2005) Local modularity measure for network clusterizations. Phys Rev E 72(5):056107

    Google Scholar 

  • Nascimento MC, Pitsoulis L (2013) Community detection by modularity maximization using GRASP with path relinking. Comput Oper Res 40(12):3121–3131

    MathSciNet  MATH  Google Scholar 

  • Nepusz T, Yu H, Paccanaro A (2012) Detecting overlapping protein complexes in protein-protein interaction networks. Nat Methods 9:471–472

    Google Scholar 

  • Newman M (2013) Spectral community detection in sparse networks. Technical report. arXiv:1308.6494v1

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

    Google Scholar 

  • Park H, Lee K (2014) Dependence clustering, a method revealing community structure with group dependence. Knowl-Based Syst 60:58–72

    Google Scholar 

  • Peel L, Larremore DB, Clauset A (2017) The ground truth about metadata and community detection in networks. Sci Adv 3(5):e1602548. https://doi.org/10.1126/sciadv.1602548

    Article  Google Scholar 

  • Pizzuti C (2012) Boosting the detection of modular community structure with genetic algorithms and local search. In: Proceedings of the 27th Annual ACM symposium on applied computing—SAC ’12, ACM Press, New York, p 226

  • Rotta R, Noack A (2011) Multilevel local search algorithms for modularity clustering. J Exp Algorithmics 16(2):21

    MathSciNet  MATH  Google Scholar 

  • Santiago R, Lamb LC (2017a) Efficient modularity density heuristics for large graphs. Eur J Oper Res 258(3):844–865

    MathSciNet  MATH  Google Scholar 

  • Santiago R, Lamb LC (2017b) Efficient Quantitative Heuristics for Graph Clustering. In: Proceedings of the genetic and evolutionary computation conference companion, ACM New York, Berlin, pp 117–118

  • de Santiago R, Lamb LC (2017) Exact computational solution of modularity density maximization by effective column generation. Comput Oper Res 86(Mdm):18–29

    MathSciNet  MATH  Google Scholar 

  • Sato K, Izunaga Y (2017) A branch-and-price approach with MILP formulation to modularity density maximization on graphs. Technical report. 1705:02961

  • Schmeja S (2011) Identifying star clusters in a field: a comparison of different algorithms. Astron Nachr 332(2):172–184 1011.5533

    Google Scholar 

  • Sun PG (2014) Weighting links based on edge centrality for community detection. Physica A 394:346–357

    Google Scholar 

  • Traag VA, Van Dooren P, Nesterov Y (2011) Narrow scope for resolution-limit-free community detection. Phys Rev E 84(1):016114 1104.3083

    Google Scholar 

  • Wang M, Zuo W, Wang Y (2016) An improved density peaks-based clustering method for social circle discovery in social networks. Neurocomputing 179:219–227. https://doi.org/10.1016/j.neucom.2015.11.091

    Article  Google Scholar 

  • Xie J, Kelley S, Szymanski BK (2013) Overlapping community detection in networks. ACM Comput Surv 45(4):1–35

    MATH  Google Scholar 

  • Xu G, Tsoka S, Papageorgiou LG (2007) Finding community structures in complex networks using mixed integer optimisation. Eur Phys J B 60:231–239

    MATH  Google Scholar 

  • Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res. https://doi.org/10.1086/jar.33.4.3629752

    Article  Google Scholar 

  • Zhao Y, Jiang W, Li S, Ma Y, Su G, Lin X (2015) A cellular learning automata based algorithm for detecting community structure in complex networks. Neurocomputing 151:1216–1226

    Google Scholar 

Download references

Acknowledgements

This work is partly supported by the Brazilian Research Council CNPq (MCTIC/CNPq 2018 - 408771/2018-6) and Federal University of Santa Catarina.

Author information

Authors and Affiliations

  1. Department of Computer Science and Statistics, Federal University of Santa Catarina, Florianópolis, SC, Brazil

    R. de Santiago

  2. Institute of Informatics, Federal University of Rio Grande do Sul, Porto Alegre, RS, Brazil

    Luís C. Lamb

Authors
  1. R. de Santiago
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luís C. Lamb
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. de Santiago.

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

de Santiago, R., Lamb, L.C. A ground truth contest between modularity maximization and modularity density maximization. Artif Intell Rev 53, 4575–4599 (2020). https://doi.org/10.1007/s10462-019-09802-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10462-019-09802-8

Keywords

Search

Navigation