Abstract
Finding efficient influencers has attracted a lot of researchers considering the advantages and the various ways in which it can be used. There are a lot of methods but most of them are available for unweighted networks, while there are numerous weighted networks available in real life. Finding influential users on weighted networks has numerous applications like influence maximization, controlling rumours, etc. Many algorithms such as weighted-Degree, weighted-VoteRank, weighted-h-index, and entropy-based methods have been used to rank the nodes in a weighted network according to their spreading capability. Our proposed method can be used in case of both weighted or unweighted networks for finding strong influencers efficiently. Weighted-VoteRank and weighted-H-index methods take the local spreading capability of the nodes into account, while entropy takes both local and global capability of influencing the nodes in consideration. In this paper, we consider the advantages and drawbacks of the various methods and propose a weighted-hybrid method using our observations. First, we try to improve the performance of weighted-VoteRank and weighted-h-index methods and then propose a weighted-hybrid method, which combines the performance of our improved weighted-VoteRank, improved weighted-H-index, and entropy method. Simulations using an epidemic model, Susceptible-Infected-Recovered (SIR) model produces better results as compared to other standard methods.
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
W. Chen, C. Wang, Y. Wang, Scalable influence maximization for prevalent viral marketing in large-scale social networks, in Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM, 2010), pp. 1029–1038
T. Opsahl, F. Agneessens, J. Skvoretz, Node centrality in weighted networks: generalizing degree and shortest paths. Soc. Netw. 32(3), 245–251 (2010)
Y. Du, C. Gao, X. Chen, Y. Hu, R. Sadiq, Y. Deng, A new closeness centrality measure via effective distance in complex networks. Chaos Interdiscip. J. Nonlinear Sci. 25(3), p. 033112 (2015)
D. Prountzos, K. Pingali, Betweenness centrality. ACM SIGPLAN Not. 48(8), 35 (2013)
S. Brin, L. Page, The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30(1–7), 107–117 (1998)
M. Kitsak, L. Gallos, S. Havlin, F. Liljeros, L. Muchnik, H. Stanley, H. Makse, Identification of influential spreaders in complex networks. Nat. Phys. 6(11), 888–893 (2010)
Z. Liu, C. Jiang, J. Wang, H. Yu, The node importance in actual complex networks based on a multi-attribute ranking method. Knowl.-Based Syst. 84, 56–66 (2015)
A. Zareie, A. Sheikhahmadi, A hierarchical approach for influential node ranking in complex social networks. Expert Syst. Appl. 93, 200–211 (2018)
J. Bae, S. Kim, Identifying and ranking influential spreaders in complex networks by neighborhood coreness. Phys. A 395, 549–559 (2014)
Z. Wang, Y. Zhao, J. Xi, C. Du, Fast ranking influential nodes in complex networks using a k-shell iteration factor. Phys. A 461, 171–181 (2016)
Z. Wang, C. Du, J. Fan, Y. Xing, Ranking influential nodes in social networks based on node position and neighborhood. Neurocomputing 260, 466–477 (2017)
J. Zhang, D. Chen, Q. Dong, Z. Zhao, Erratum: Corrigendum: Identifying a set of influential spreaders in complex networks. Sci. Rep. 6(1) (2016)
L. Lü, T. Zhou, Q. Zhang, H. Stanley, The H-index of a network node and its relation to degree and coreness. Nat. Commun. 7(1) (2016)
A. Nikolaev, R. Razib, A. Kucheriya, On efficient use of entropy centrality for social network analysis and community detection. Soc. Netw. 40, 154–162 (2015)
A. Garas, F. Schweitzer, S. Havlin, Ak-shell decomposition method for weighted networks. New J. Phys. 14(8), 083030 (2012)
S. Kumar, B.S. Panda, Identifying influential nodes in social networks: neighborhood coreness based voting approach. Phys. A 124215 (2020)
H.L. Sun, D.B. Chen, J.L. He, E. Chng, A voting approach to uncover multiple influential spreaders on weighted networks. Phys. A 519, 303–312 (2019)
T. Qiao, W. Shan, G. Yu, C. Liu, A novel entropy-based centrality approach for identifying vital nodes in weighted networks. Entropy 20(4), 261 (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Kumar, S., Raghav, Y., Nag, B. (2021). Finding Influential Spreaders in Weighted Networks Using Weighted-Hybrid Method. In: Gupta, D., Khanna, A., Bhattacharyya, S., Hassanien, A.E., Anand, S., Jaiswal, A. (eds) International Conference on Innovative Computing and Communications. Advances in Intelligent Systems and Computing, vol 1166. Springer, Singapore. https://doi.org/10.1007/978-981-15-5148-2_37
Download citation
DOI: https://doi.org/10.1007/978-981-15-5148-2_37
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-5147-5
Online ISBN: 978-981-15-5148-2
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)