Abstract
The community detection algorithm is a hot issue in the study of social networks. However, the existing label propagation algorithms have the problem of excessive label propagation. In order to solve this problem, we propose a new community detection algorithm based on node correlation and modularity (NCMA). In the first step, resource allocation and hub depressed are used to judge whether the label of the current node has changed. In the process of label propagation, if the node has multiple labels that meet the label propagation conditions, stop propagating labels to the node, so as to limit the propagation ability of some key nodes. In the second step, for the communities detected in the first step, two communities with the highest modularity will be selected for merging until there is no modular gain in merging any communities. The results show that compared with other algorithms, this algorithm has higher running speed, better modularity and stability.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
De Meo, P., Ferrara, E., Fiumara, G., Provetti, A.: Generalized Louvain method for community detection in large networks. In: 2011 11th International Conference on Intelligent Systems Design and Applications, pp. 88–93. IEEE (2011)
Kim, J., Hastak, M.: Social network analysis: characteristics of online social networks after a disaster. Int. J. Inf. Manag. 38(1), 86–96 (2018)
Bo, Y., Liu, J., Feng, J.: On the spectral characterization and scalable mining of network communities. IEEE Trans. Knowl. Data Eng. 24(2), 326–337 (2010)
Ostovari, M., Yu, D.: Impact of care provider network characteristics on patient outcomes: usage of social network analysis and a multi-scale community detection. PLoS ONE 14(9), e0222016 (2019)
Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3–5), 75–174 (2010)
Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech: Theory Exp. 2008(10), P10008 (2008)
Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. Proc. Natl. Acad. Sci. 105(4), 1118–1123 (2008)
Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3), 036106 (2007)
Barber, M.J., Clark, J.W.: Detecting network communities by propagating labels under constraints. Phys. Rev. E 80(2), 026129 (2009)
Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)
Liu, X., Murata, T.: Advanced modularity-specialized label propagation algorithm for detecting communities in networks. Physica A: Stat. Mech. Appl. 389(7), 1493–1500 (2010)
Zhang, X.-K., Ren, J., Song, C., Jia, J., Zhang, Q.: Label propagation algorithm for community detection based on node importance and label influence. Phys. Lett. A 381(33), 2691–2698 (2017)
Xing, Y., Meng, F., Zhou, Y., Zhu, M., Shi, M., Sun, G.: A node influence based label propagation algorithm for community detection in networks. Sci. World J. 2014 (2014)
Li, W., Huang, C., Wang, M., Chen, X.: Stepping community detection algorithm based on label propagation and similarity. Physica A 472, 145–155 (2017)
Wang, T., Chen, S., Wang, X., Wang, J.: Label propagation algorithm based on node importance. Physica A 551, 124137 (2020)
Brown, T.C.: The concept of value in resource allocation. Land Econ. 60(3), 231–246 (1984)
Ayoub, J., Lotfi, D., El Marraki, M., Hammouch, A.: Accurate link prediction method based on path length between a pair of unlinked nodes and their degree. Soc. Netw. Anal. Min. 10(1), 1–13 (2020). https://doi.org/10.1007/s13278-019-0618-2
Knuth, D.E.: The Stanford GraphBase: A Platform for Combinatorial Computing. ACM Press, New York (1993)
Gleiser, P.M., Danon, L.: Community structure in jazz. Adv. Complex Syst. 6(04), 565–573 (2003)
Duch, J., Arenas, A.: Community detection in complex networks using extremal optimization. Phys. Rev. E 72(2), 027104 (2005)
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(6), 065103 (2003)
Leicht, E.A., Holme, P., Newman, M.E.: Vertex similarity in networks. Phys. Rev. E 73(2), 026120 (2006)
Bu, D., et al.: Topological structure analysis of the protein–protein interaction network in budding yeast. Nucleic Acids Res. 31(9), 2443–2450 (2003)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393(6684), 440–442 (1998)
Rozemberczki, B., Sarkar, R.: Characteristic functions on graphs: birds of a feather, from statistical descriptors to parametric models. In: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, pp. 1325–1334 (2020)
Boguná, 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)
Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33(4), 452–473 (1977)
Lusseau, D., Newman, M.E.: Identifying the role that animals play in their social networks. Proc. R. Soc. Lond. Ser. B: Biol. Sci. 271(Suppl_6), S477–S481 (2004)
Wang, T., Yin, L., Wang, X.: A community detection method based on local similarity and degree clustering information. Physica A 490, 1344–1354 (2018)
Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821–7826 (2002)
Adamic, L.A., Glance, N.: The political blogosphere and the 2004 US election: divided they blog. In: Proceedings of the 3rd International Workshop on Link Discovery, pp. 36–43 (2005)
Danon, L., Diaz-Guilera, A., Duch, J., Arenas, A.: Comparing community structure identification. J. Stat. Mech: Theory Exp. 2005(09), P09008 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Guo, F., Sun, L. (2022). Community Detection Algorithm Based on Node Correlation and Modularity. In: Liu, Q., Liu, X., Cheng, J., Shen, T., Tian, Y. (eds) Proceedings of the 12th International Conference on Computer Engineering and Networks. CENet 2022. Lecture Notes in Electrical Engineering, vol 961. Springer, Singapore. https://doi.org/10.1007/978-981-19-6901-0_63
Download citation
DOI: https://doi.org/10.1007/978-981-19-6901-0_63
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-6900-3
Online ISBN: 978-981-19-6901-0
eBook Packages: Computer ScienceComputer Science (R0)