Abstract
Community detection is a fundamental task in discovering complex network. Maximal cliques are found to play significant roles in communities. This paper proposes an efficient algorithm OMC for detecting communities based on maximal cliques. Subordinate maximal cliques are removed and remaining cliques are regarded as initial communities. Then small communities are merged into larger ones according to a fitness function. The proposed algorithm is able to uncover both overlapping and hierarchical communities in high speed. Experimental results on various real-word networks have proven that the method performed well in detecting communities.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. U.S.A. 99, 8271–8276 (2001)
Palla, G., Derenyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 814 (2005)
Lee, C., McDaid, A., Reid, F., et al.: Detecting highly overlapping community structure by greedy clique expansion. Paper presented at the 4th SNA-KDD Workshop 2010 (SNA-KDD 2010), 25 July, 2010, Washington, DC, USA (2010)
Shen, H., Cheng, X., Cai, K., Hu, M.: Detect overlapping and hierarchical community structure in networks. Phys. A Stat. Mech. Appl. 388, 1706 (2009)
Zhang, Z., Wang, Z.: Mining overlapping and hierarchical communities in complex networks. Phys. A: Stat. Mech. Appl. 421, 25 (2015)
Cui, Y., Wang, X., Li, J.: Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient. Phys. A: Stat. Mech. Appl. 405, 85 (2014)
Lancichinetti, A., Fortunato, S., Kertesz, J.: Detecting the overlapping and hierarchical community structure in complex networks. New J. Phys. 11, 20 (2009)
Coscia, M., Rossetti, G., Giannotti, F., Pedreschi, D.: Uncovering Hierarchical and Overlapping Communities with a Local-First Approach. ACM Trans. Knowl. Disc. Data. 9, 1 (2014)
Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575–577 (1973)
Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E: Stat. Nonlin. Soft. Matter. Phys. 69, 26113 (2004)
Guimera, R., Danon, L., Diaz-Guilera, A., Giralt, F., Arenas, A.: Self-similar community structure in a network of human interactions. Phys. Rev. E: Stat. Nonlin. Soft. Matter. Phys. 68, 65103 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media Singapore
About this paper
Cite this paper
Huang, Z., Wang, Z., Zhang, Z. (2015). Detecting Overlapping and Hierarchical Communities in Complex Network Based on Maximal Cliques. In: Zhang, X., Sun, M., Wang, Z., Huang, X. (eds) Social Media Processing. SMP 2015. Communications in Computer and Information Science, vol 568. Springer, Singapore. https://doi.org/10.1007/978-981-10-0080-5_17
Download citation
DOI: https://doi.org/10.1007/978-981-10-0080-5_17
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-0079-9
Online ISBN: 978-981-10-0080-5
eBook Packages: Computer ScienceComputer Science (R0)