Abstract
Community structure identification in complex networks has been an important research topic in recent years. In this paper, a new between-ness centrality algorithm with local search called BCALS in short, is proposed as an effective optimization technique to solve the community detection problem with the advantage that the number of communities is automatically determined in the process. BCALS selects at first, leaders according to their measure of between-ness centrality, then it selects randomly a node and calculates its local function for all communities and assigns it to the community that optimizes its local function. Experiments show that BCALS gets effective results compared to other detection community algorithms found in the literature.
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
Similar content being viewed by others
References
Newman, M.E.J., Girvan, M.: Community structure in social and biological networks. Proc. Natl. Acad. Sci 99, 7821–7826 (2002)
Johnson, D.S., Garey, M.R.: Computers and intractability: a guide to the theory of np-completeness. Wiley Computer Publishing, (Freeman, San Francisco) (1979)
Farkas, I., Palla, G., Derenyi, I., Vicsek, T.: Uncovering the overlapping community structures of complex networks in nature and society. Nature 435, 814–818 (2005)
Cheung, W.K., Yang, B., Liu, J.: Community mining from signedsocial networks. IEEE Trans. Knowl. Data Eng. 17, 1333–1348 (2007)
Albert, R., Raghavan, U.N., Kumara, S.: Near linear-time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76, 036–106 (2007)
Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 026–113 (2004)
Fortunato, S.: Community detection in graphs. Phys. Rep. 486, 75–174 (2010)
Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70, 066–111 (2004)
Liu, D., Jin, D., He, D., Baquero, C.: Genetic algorithm with local search for community mining in complex networks. In: Proceedings of the 22th International Conference on Tools with Artificial Intelligence (ICTAI 2010), pp. 105–112 (2010)
Gaertler, M., Gorke, R., Hoefer, M., Nikoloski, Z., Brandes, U., Delling, D., Wagner, D.: On modularity clustering (2008)
Wang, Y.: An improved complex network community detection algorithm based on k-means. Adv. Intell. Soft Comput. 160, 243–248 (2012)
Chen, H., Zhang, B., Yin, C., Zhu, S., David, B.: A method for community detection of complex networks based on hierarchical clustering. Int. J. Distrib. Sens. Netw. 2015, 9 (2015)
Wang, Z., Wang, L., Hu, Y., Wu, L., Bai, T., Ji, J.: A new community detection algorithm based on distance centrality. In: 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) 2013, pp. 898–902 (2013)
Khorasgani, O.R.R., Chen, J., Zaane, R.: Top leaders community detection approach in information networks. In: Proceedings of the 2010 International Conference on Knowledge Discovery, Data Mining (KDD 2010), Washington DC, USA (2010)
Freeman, L.: A set of measures of centrality based upon betweenness. Sociometry 40, 35–41 (1977)
Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33, 452–473 (1977)
Lusseau, D.: The emergent properties of dolphin social network. In: Reaka-Kulda, M.L., Wilson, D.E., Wilson, E.O. (eds.) Proceedings of the Royal Society of London. Series B: Biological Sciences, vol. 270, pp. 186–188 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Belkhiri, Y., Kamel, N., Drias, H. (2016). A New Betweenness Centrality Algorithm with Local Search for Community Detection in Complex Network. In: Nguyen, N.T., Trawiński, B., Fujita, H., Hong, TP. (eds) Intelligent Information and Database Systems. ACIIDS 2016. Lecture Notes in Computer Science(), vol 9622. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49390-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-662-49390-8_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-49389-2
Online ISBN: 978-3-662-49390-8
eBook Packages: Computer ScienceComputer Science (R0)