Skip to main content
SpringerLink
Log in

Improving the Louvain Algorithm for Community Detection with Modularity Maximization

  • Conference paper
  • First Online:
Artificial Evolution (EA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8752))

Abstract

This paper presents an enhancement of the well-known Louvain algorithm for community detection with modularity maximization which was introduced in [16]. The Louvain algorithm is a partial multi-level method which applies the vertex mover heuristic to a series of coarsened graphs. The Louvain+ algorithm proposed in this paper generalizes the Louvain algorithm by including a uncoarsening phase, leading to a full multi-level method. Experiments on a set of popular complex networks show the benefits induced by the proposed Louvain+ algorithm.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The source code of our Louvain+ algorithm will be made available at www.info.univ-angers.fr/pub/hao/Louvainplus.html.

References

  1. Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99(12), 7821–7826 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Guimerà, R., Amaral, L.A.N.: Functional cartography of complex metabolic networks. Nat. 433(7028), 895–900 (2005)

    Article  Google Scholar 

  3. Flake, G.W., Lawrence, S., Giles, C.L., Coetzee, F.M.: Self-organization and identification of web communities. Comput. 35(3), 66–70 (2002)

    Article  Google Scholar 

  4. Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.: Complex networks: structure and dynamics. Phys. Rep. 424(4–5), 175–308 (2006)

    Article  MathSciNet  Google Scholar 

  5. Strogatz, S.H.: Exploring complex networks. Nat. 410(6825), 268–276 (2001)

    Article  Google Scholar 

  6. Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47 (2002)

    Article  MATH  Google Scholar 

  7. Newman, M.: Networks: An Introduction. Oxford University Press, New York (2010)

    Book  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  11. Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(6), 066111 (2004)

    Article  Google Scholar 

  12. Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69(6), 066133 (2004)

    Article  Google Scholar 

  13. Schuetz, P., Caflisch, A.: Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement. Phys. Rev. E 77(4), 046112 (2008)

    Article  Google Scholar 

  14. Lü, Z., Huang, W.: Iterated tabu search for identifying community structure in complex networks. Phys. Rev. E 80(2), 026130 (2009)

    Article  Google Scholar 

  15. Duch, J., Arenas, A.: Community detection in complex networks using extremal optimization. Phys. Rev. E 72(2), 027104 (2005)

    Article  Google Scholar 

  16. Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theor. Exp. 10, P10008 (2008)

    Article  Google Scholar 

  17. Liu, X., Murata, T.: Advanced modularity-specialized label propagation algorithm for detecting communities in networks. Phys. A 389(7), 1493–1500 (2009)

    Article  Google Scholar 

  18. Noack, A., Rotta, R.: Multi-level algorithms for modularity clustering. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol. 5526, pp. 257–268. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  19. Gach, O., Hao, J.-K.: A memetic algorithm for community detection in complex networks. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012, Part II. LNCS, vol. 7492, pp. 327–336. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  20. Walshaw, C.: Multilevel refinement for combinatorial optimisation problems. Ann. Oper. Res. 131, 325–372 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  21. Arenas, A., Duch, J., Fernández, A., Gómez, S.: Size reduction of complex networks preserving modularity. N. J. Phys. 9(6), 176 (2007)

    Article  Google Scholar 

  22. Gleiser, P., Danon, L.: Community structure in social and biological networks. Adv. Complex Syst. 6, 565–573 (2003)

    Article  Google Scholar 

  23. Guimerà, R., Danon, L., Díaz-Guilera, A., Giralt, F., Arenas, A.: Self-similar community structure in a network of human interactions. Phys. Rev. E 68(6), 065103 (2003)

    Article  Google Scholar 

  24. Watts, D.J., Strogatz, S.H.: Collective dynamics of “small-world” networks. Nat. 393(6684), 440–442 (1998)

    Article  Google Scholar 

  25. Bu, D., Zhao, Y., Cai, L., Xue, H., Zhu, X., Lu, H., Zhang, J., Sun, S., Ling, L., Zhang, N., Li, G., Chen, R.: Topological structure analysis of the protein-protein interaction network in budding yeast. Nucleic Acids Res. 31(9), 2443–2450 (2003)

    Article  Google Scholar 

  26. Grossman, J.: The erdös number project (2007). http://www.oakland.edu/enp/

  27. KDD, Cornell kdd cup (2003). http://www.cs.cornell.edu/projects/kddcup/

  28. Boguñá, M., Pastor-Satorras, R., Díaz-Guilera, A., Arenas, A.: Models of social networks based on social distance attachment. Phys. Rev. E 70(5), 056122 (2004)

    Article  Google Scholar 

  29. Newman, M.E.J.: The structure of scientific collaboration networks. Proc. Natl. Acad. Sci. USA 98(2), 404–409 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  30. Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Disc. Data 1(1), Article No. 2 (2007). doi:10.1145/1217299.1217301

  31. Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6(1), 66 (2008)

    MathSciNet  Google Scholar 

  32. Cho, E., Myers, S.A., Leskovec, J.: Friendship and mobility: user movement in location-based social networks. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1082–1090 (2011)

    Google Scholar 

  33. Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., Parisi, D.: Defining and identifying communities in networks. Proc. Natl. Acad. Sci. USA 101(9), 2658–2663 (2004)

    Article  Google Scholar 

  34. Danon, L., Díaz-Guilera, A., Duch, J., Arenas, A.: Comparing community structure identification. J. Stat. Mech. Theor. Exp. 2005(09), P09008 (2005)

    Article  Google Scholar 

Download references

Acknowledgment

We are grateful to the referees for their comments and questions which helped us to improve the paper. The work is partially supported by the Pays de la Loire Region (France) within the RaDaPop (2009–2013) and LigeRO (2010–2013) projects.

Author information

Authors and Affiliations

  1. LIUM, Université du Maine, Av. O. Messiaen, 72085, Le Mans, France

    Olivier Gach

  2. LERIA, Université d’Angers, 2 Bd Lavoisier, 49045, Angers Cedex 01, France

    Olivier Gach & Jin-Kao Hao

Authors
  1. Olivier Gach
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jin-Kao Hao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Olivier Gach .

Editor information

Editors and Affiliations

  1. INRIA Bordeaux sud-ouest, Equipe CQFD, Institut de Mathématiques de Bordeaux, Université de Bordeaux, Bordeaux, France

    Pierrick Legrand

  2. Université de Bordeaux, Bordeaux, France

    Marc-Michel Corsini

  3. Université d'Angers, Angers Cedex 01, France

    Jin-Kao Hao

  4. Laboratoire d’Informatique de l’Université de Tours, Ecole Polytechnique de l’Université de Tours, Tours, France

    Nicolas Monmarché

  5. INRA, UMR, Thirverval-Grignon, France

    Evelyne Lutton

  6. Equipe TAO, INRIA Futurs, LRI, University of Paris Sud, Orsay cedex, France

    Marc Schoenauer

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Gach, O., Hao, JK. (2014). Improving the Louvain Algorithm for Community Detection with Modularity Maximization. In: Legrand, P., Corsini, MM., Hao, JK., Monmarché, N., Lutton, E., Schoenauer, M. (eds) Artificial Evolution. EA 2013. Lecture Notes in Computer Science(), vol 8752. Springer, Cham. https://doi.org/10.1007/978-3-319-11683-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11683-9_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11682-2

  • Online ISBN: 978-3-319-11683-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation