Abstract
With the prosperity of social networks, Influence maximization is a crucial analysis drawback within the field of network science due to its business value. In this regard, we propose the EAVoteRank++, inspired by VoteRank++, to iteratively select the influential node. It is commonly recognized that degree is a well-known centrality metric for identifying prominent nodes, and neighbors’ contributions should also be considered. Furthermore, topological connections between neighbors have an impact on node spreading ability; the more connections between neighbors, the higher the risk of infection. Therefore, EAVoterank++ algorithm identify nodes’s voting ability by considering degree, position in network by improve k-shell decomposition and clustering coefficient as well as neighbors. The weights of attribute are calculated by entropy technology. Furthermore, based on VoteRank++, EAVoteRank++ minimizes the voting ability of 2-hop neighbors of the selected nodes to decrease the overlapping of influential regions of spreaders. To demonstrate the effectiveness of the proposed method, we employ both the SIR model and LS model to simulate the spreading progress, then calculate the accuracy of the proposed algorithm, compare with other methods. The experimental results with 2 propagation simulation models on 6 datasets demonstrate the good performance of the proposed method on discrimination capability and accuracy.
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
Bond, R.M., et al.: A 61-million-person experiment in social influence and political mobilization. Nature 489(7415), 295–298 (2012)
Perozzi, B., Al-Rfou, R., Skiena, S.S.: DeepWalk: online learning of social representations. In: ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (2014)
Dinh, X.T., Van Pham, H.: Social network analysis based on combining probabilistic models with graph deep learning. In: Sharma, H., Gupta, M.K., Tomar, G.S., Lipo, W. (eds.) Communication and Intelligent Systems. LNNS, vol. 204, pp. 975–986. Springer, Singapore (2021). https://doi.org/10.1007/978-981-16-1089-9_76
Wang, D., Cui, P., Zhu, W.W.: Structural deep network embedding. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1225–1234 (2016)
Mikolov, T., Sutskever, I., Chen, K., et al.: Distributed representations of words and phrases and their compositionality. Adv. Neural Inf. Process. Syst. 26, 3111–3119 (2013)
Gao, Y.-C., Fu, C.-J., Cai, S.-M., Yang, C., Eugene Stanley, H.: Repulsive synchroni-zation in complex networks. Chaos 29, 053130 (2019)
Brin, S., Page, L.: Reprint of: the anatomy of a large-scale hypertextual web search engine. Comput. Netw. 56(18), 3825–3833 (2012)
Ma, L.L., Ma, C., Zhang, H.F., Wang, B.H.: Identifying influential spreaders in complex networks based on gravity formula. Phys. A 451, 205–212 (2016)
Zhang, J.-X., Chen, D.-B., Dong, Q., Zhao, Z.-D.: Identifying a set of influential spreaders in complex networks. Sci. Rep. 6(1), 27823 (2016)
Guo, C., Yang, L., Chen, X., Chen, D., Gao, H., Ma, J.: Influential nodes identification in complex networks via information entropy. Entropy 22(2), 1–19 (2020)
Liu, P., et al.: Identifying influential nodes in social networks: a voting approach. Chaos Solitons Fractals 152, 111309 (2021)
Sabidussi, G.: Thee centrality index of a graph. Psychometrika 31(4), 581–603 (1966)
Li, Z., Huang, X.: Identifying influential spreaders in complex networks by an improved gravity model. Sci. Rep. 11(1), 1–10 (2021)
Eguiluz, V.M., Klemm, K.: Epidemic threshold in structured scale-free networks. Phys. Rev. Lett. 89(10), 108701 (2002)
Lü, L., Zhou, T., Zhang, Q.-M., Stanley, H.E.: The H-index of a network node and its relation to degree and coreness. Nat. Commun. 7(1), 10168 (2016)
Sheikhahmadi, A., Nematbakhsh, M.A.: Identification of multi-spreader users in social networks for viral marketing. J. Inf. Sci. 43(3), 412–423 (2017)
Zareie, A., Sheikhahmadi, A., Jalili, M., Fasaei, M.S.K.: Finding influential nodes in social networks based on neighborhood correlation coefficient. Knowl Based Syst 194, 105580 (2020)
Yang, Y., et al.: A novel centrality of influential nodes identification in complex networks. IEEE Access 8, 58742–58751 (2020)
Shulgin, B., Stone, L., Agur, Z.: Pulse vaccination strategy in the SIR epidemic model. Bull. Math. Biol. 60(6), 1123–1148 (1998)
Acknowledgment
This research is funded by CMC Institute of Science and Technology (CIST), CMC Corporation, Vietnam.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Van Duong, P., Dang, T.M., Son, L.H., Van Hai, P. (2022). Enhancement of Voting Scores with Multiple Attributes Based on VoteRank++ to Identify Influential Nodes in Social Networks. In: Pinto, A.L., Arencibia-Jorge, R. (eds) Data and Information in Online Environments. DIONE 2022. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 452. Springer, Cham. https://doi.org/10.1007/978-3-031-22324-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-031-22324-2_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-22323-5
Online ISBN: 978-3-031-22324-2
eBook Packages: Computer ScienceComputer Science (R0)