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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast Unfolding of Communities in Large Networks. J. Stat. Mech., P10008 (2008)
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)
Clauset, A., Moore, C., Newman, M.E.J.: Hierarchical Structure and the Prediction of Missing Links in Networks. Nature 453, 98–101 (2008)
Clauset, A., Newman, M.E.J., Moore, C.: Finding Community Structure in Very Large Networks. Phys. Rev. E 70, 066111 (2004)
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)
Danon, L., Diaz-Guilera, A., Duch, J., Arenas, A.: Comparing Community Structure Identification. J. Stat. Mech., P09008 (2005)
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)
Freeman, L.C.: A Set of Measures of Centrality Based on Betweenness. Sociometry 40, 35–41 (1977)
Girvan, M., Newman, M.E.J.: Community Structure in Social and Biological Networks. P. Natl. Acad. Sci. USA 99, 7821–7826 (2002)
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)
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)
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)
Hofman, J.M., Wiggins, C.H.: Bayesian Approach to Network Modularity. Phys. Rev. Lett. 100, 258701 (2008)
Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2, 193–218 (1985)
Lancichinetti, A., Fortunato, S., Kertesz, J.: Detecting the Overlapping and Hierarchical Community Structure of Complex Networks (2008) Eprint arXiv:0802.1218v1 at arxiv.org
Newman, M.E.J.: The Structure of Scientific Collaboration Networks. P. Natl. Acad. Sci. USA 98, 404–409 (2001)
Newman, M.E.J.: Detecting Community Structure in Networks. Eur. Phys. J. B 38, 321–330 (2004)
Newman, M.E.J.: Finding Community Structure in Networks Using the Eigenvectors of Matrices. Phys. Rev. E 74, 036104 (2006)
Newman, M.E.J.: Modularity and Community Structure in Networks. P. Natl. Acad. Sci. USA 103, 8577–8582 (2006)
Newman, M.E.J., Girvan, M.: Finding and Evaluating Community Structure in Networks. Phys. Rev. E 69, 026113 (2004)
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
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)
Pons, P., Latapy, M.: Computing Communities in Large Networks Using Random Walks. J. Graph Algorithms and Applications 10(2), 191–218 (2006)
Rand, W.M.: Objective Criteria for the Evaluation of Clustering Methods. J. Am. Stat. Assoc. 66, 846–850 (1971)
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)
Xie, N.: Social Network Analysis of Blogs. MSc Dissertation. University of Bristol (2006)
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)
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)
Clauset, A.: http://cs.unm.edu/~aaron/research/fastmodularity.htm
Wakita, K.: http://www.is.titech.ac.jp/~wakita/en/software/community-analysis-software
Guillaume, J-L.: http://findcommunities.googlepages.com
Pons, P.: http://psl.pons.free.fr/index.php?item=prog&lang=en
CFinder: http://www.cfinder.org
Gregory, S.: http://www.cs.bris.ac.uk/~steve/networks
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)