Skip to main content
SpringerLink
Log in

Finding Overlapping Communities Using Disjoint Community Detection Algorithms

  • Chapter
Complex Networks

Part of the book series: Studies in Computational Intelligence ((SCI,volume 207))

Abstract

Many algorithms have been designed to discover community structure in networks. Most of these detect disjoint communities, while a few can find communities that overlap. We propose a new, two-phase, method of detecting overlapping communities. In the first phase, a network is transformed to a new one by splitting vertices, using the idea of split betweenness; in the second phase, the transformed network is processed by a disjoint community detection algorithm. This approach has the potential to convert any disjoint community detection algorithm into an overlapping community detection algorithm. Our experiments, using several “disjoint” algorithms, demonstrate that the method works, producing solutions, and execution times, that are often better than those produced by specialized “overlapping” algorithms.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adamcsek, B., Palla, G., Farkas, I., Derényi, I., Vicsek, T.: CFinder: Locating Cliques and Overlapping Modules in Biological Networks. Bioinformatics 22, 1021–1023 (2006)

    Article  Google Scholar 

  2. Baumes, J., Goldberg, M., Magdon-Ismail, M.: Efficient Identification of Overlapping Communities. In: Kantor, P., Muresan, G., Roberts, F., Zeng, D.D., Wang, F.-Y., Chen, H., Merkle, R.C. (eds.) ISI 2005. LNCS, vol. 3495, pp. 27–36. Springer, Heidelberg (2005)

    Google Scholar 

  3. Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast Unfolding of Communities in Large Networks. J. Stat. Mech., P10008 (2008)

    Google Scholar 

  4. Boguña, M., Pastor-Satorras, R., Diaz-Guilera, A., Arenas, A.: Models of Social Networks Based on Social Distance Attachment. Phys. Rev. E 70, 056122 (2004)

    Article  Google Scholar 

  5. Clauset, A., Moore, C., Newman, M.E.J.: Hierarchical Structure and the Prediction of Missing Links in Networks. Nature 453, 98–101 (2008)

    Article  Google Scholar 

  6. Clauset, A., Newman, M.E.J., Moore, C.: Finding Community Structure in Very Large Networks. Phys. Rev. E 70, 066111 (2004)

    Article  Google Scholar 

  7. Collins, L.M., Dent, C.W.: Omega: A General Formulation of the Rand Index of Cluster Recovery Suitable for Non-disjoint Solutions. Multivar. Behav. Res. 23, 231–242 (1988)

    Article  Google Scholar 

  8. Danon, L., Diaz-Guilera, A., Duch, J., Arenas, A.: Comparing Community Structure Identification. J. Stat. Mech., P09008 (2005)

    Google Scholar 

  9. Fred, A.L.N., Jain, A.K.: Robust Data Clustering. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 128–133. IEEE Press, New York (2003)

    Google Scholar 

  10. Freeman, L.C.: A Set of Measures of Centrality Based on Betweenness. Sociometry 40, 35–41 (1977)

    Article  Google Scholar 

  11. Girvan, M., Newman, M.E.J.: Community Structure in Social and Biological Networks. P. Natl. Acad. Sci. USA 99, 7821–7826 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  12. Gregory, S.: An Algorithm to Find Overlapping Community Structure in Networks. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladenič, D., Skowron, A. (eds.) PKDD 2007. LNCS (LNAI), vol. 4702, pp. 91–102. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Gregory, S.: A Fast Algorithm to Find Overlapping Communities in Networks. In: Daelemans, W., Goethals, B., Morik, K. (eds.) PKDD 2008. LNCS (LNAI), vol. 5211, pp. 408–423. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Guimera, R., Danon, L., Diaz-Guilera, A., Giralt, F., Arenas, A.: Self-similar Community Structure in a Network of Human Interactions. Phys. Rev. E 68, 065103(R) (2003)

    Article  Google Scholar 

  15. Hofman, J.M., Wiggins, C.H.: Bayesian Approach to Network Modularity. Phys. Rev. Lett. 100, 258701 (2008)

    Article  Google Scholar 

  16. Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2, 193–218 (1985)

    Article  Google Scholar 

  17. Lancichinetti, A., Fortunato, S., Kertesz, J.: Detecting the Overlapping and Hierarchical Community Structure of Complex Networks (2008) Eprint arXiv:0802.1218v1 at arxiv.org

    Google Scholar 

  18. Newman, M.E.J.: The Structure of Scientific Collaboration Networks. P. Natl. Acad. Sci. USA 98, 404–409 (2001)

    Article  MATH  Google Scholar 

  19. Newman, M.E.J.: Detecting Community Structure in Networks. Eur. Phys. J. B 38, 321–330 (2004)

    Article  Google Scholar 

  20. Newman, M.E.J.: Finding Community Structure in Networks Using the Eigenvectors of Matrices. Phys. Rev. E 74, 036104 (2006)

    Article  Google Scholar 

  21. Newman, M.E.J.: Modularity and Community Structure in Networks. P. Natl. Acad. Sci. USA 103, 8577–8582 (2006)

    Article  Google Scholar 

  22. Newman, M.E.J., Girvan, M.: Finding and Evaluating Community Structure in Networks. Phys. Rev. E 69, 026113 (2004)

    Article  Google Scholar 

  23. Nicosia, V., Mangioni, G., Carchiolo, V., Malgeri, M.: Extending Modularity Definition for Directed Graphs with Overlapping Communities (2008) Eprint arXiv:0801.1647v3 at arxiv.org

    Google Scholar 

  24. Palla, G., Derényi, I., Farkas, I., Vicsek, T.: Uncovering the Overlapping Community Structure of Complex Networks in Nature and Society. Nature 435, 814–818 (2005)

    Article  Google Scholar 

  25. Pons, P., Latapy, M.: Computing Communities in Large Networks Using Random Walks. J. Graph Algorithms and Applications 10(2), 191–218 (2006)

    MATH  MathSciNet  Google Scholar 

  26. Rand, W.M.: Objective Criteria for the Evaluation of Clustering Methods. J. Am. Stat. Assoc. 66, 846–850 (1971)

    Article  Google Scholar 

  27. Wakita, K., Tsurumi, T.: Finding Community Structure in a Mega-scale Social Networking Service. In: IADIS International Conference on WWW/Internet 2007, pp. 153–162 (2007)

    Google Scholar 

  28. Xie, N.: Social Network Analysis of Blogs. MSc Dissertation. University of Bristol (2006)

    Google Scholar 

  29. Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.: SCAN: a Structural Clustering Algorithm for Networks. In: 13th International Conference on Knowledge Discovery and Data Mining, KDD 2007, pp. 824–833. ACM, New York (2007)

    Chapter  Google Scholar 

  30. Zhang, S., Wang, R., Zhang, X.: Identification of Overlapping Community Structure in Complex Networks Using Fuzzy C-means Clustering. Physica A 374(1), 483–490 (2007)

    Article  Google Scholar 

  31. Clauset, A.: http://cs.unm.edu/~aaron/research/fastmodularity.htm

  32. Wakita, K.: http://www.is.titech.ac.jp/~wakita/en/software/community-analysis-software

  33. Guillaume, J-L.: http://findcommunities.googlepages.com

  34. Pons, P.: http://psl.pons.free.fr/index.php?item=prog&lang=en

  35. CFinder: http://www.cfinder.org

  36. Gregory, S.: http://www.cs.bris.ac.uk/~steve/networks

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bristol, Bristol, BS8 1UB, England

    Steve Gregory

Authors
  1. Steve Gregory
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Complex Networks Lagrange Laboratory, ISI Foundation, Viale S. Severo 65, 10133, Torino, Italy

    Santo Fortunato

  2. Dipartimento di Ingegneria, Informatica e delle Telecomunicazioni, Università degli Studi di Catania, Viale Andrea Doria, 6, I95125, Catania, Italy

    Giuseppe Mangioni

  3. Department of Computer Sciences, Florida Institute of Technology, 150W.University Blvd, FL 32901, Melbourne, USA

    Ronaldo Menezes

  4. Laboratorio sui Sistemi Complessi, Scuola Superiore di Catania, Via S.Nullo 5/i, 95123, Catania, Italy

    Vincenzo Nicosia

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gregory, S. (2009). Finding Overlapping Communities Using Disjoint Community Detection Algorithms. In: Fortunato, S., Mangioni, G., Menezes, R., Nicosia, V. (eds) Complex Networks. Studies in Computational Intelligence, vol 207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01206-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01206-8_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01205-1

  • Online ISBN: 978-3-642-01206-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation