A Study on Maximising the Influence of Social Network Nodes Based on a Comprehensive Influence Hierarchy Model: Structural Analysis and Optimisation of Information Dissemination
DOI:
https://doi.org/10.54097/hyhxhj14Keywords:
Social Networks; Influence Maximisation; Information Dissemination Management. CILM; NITA.Abstract
The work of network power is related to the construction of public opinion and the management of information dissemination, which is crucial to the development of industry and information technology. It has been a key issue to study how to maximise positive information influence in social network information dissemination. This study focuses on network structure and node influence distribution, and proposes a comprehensive influence level model (CILM) and an innovative node influence factor. The factor integrates the influence level and node degree attributes to provide a basis for node influence assessment. Further, the Neighbour Influence Traversal Algorithm (NITA) and Influence Cascade Transfer Algorithm (ICTA) are designed to optimize the node influence calculation through the network structure and information dissemination characteristics. Experimentally, it is proved that CILM and related algorithms are significantly better than other methods in terms of accuracy and running time, and provide an effective tool for the optimisation of information dissemination in social networks.
Downloads
References
Xinhua News Agency, "Outline of the Fourteenth Five-Year Plan for the National Economic and Social Development of the People's Republic of China and Vision 2035," http://www.gov.cn/xinwen/2021-03/13/content_5592681.htm, 2021 13 March 2021
S. Cheng, H. W. Shen, J. Huang, et al, “IMRank: Influence Maximization via Finding Self-Consistent Ranking”, ACM, 2014.
P. Domingos, M. Richardson, “Mining the network value of customers”, ACM(Knowledge Discovery & Data Mining), 2001, 57–66, 01.
M. Richardson, P. Domingos, “Mining knowledge-sharing sites for viral marketing”, ACM(Knowledge Discovery & Data Mining), 2002, 61–70, 02.
Kempe, et al, “Maximizing the spread of influence through a social network”, ACM(Knowledge Discovery & Data Mining), 2003, 03.
J. Leskovec, A. Krause, C. Guestrin, et al, “Cost-effective outbreak detection in networks”, ACM (Knowledge Discovery & Data Mining), 2007, 420-429, 07.
W. Chen, Y. Wang, S. Yang, “Efficient influence maximization in social networks”, ACM (Knowledge Discovery & Data Mining), 2009, 199–208, 09.
Goyal, W. Lu, and L. V. Lakshmanan, “Celf++: optimizing the greedy algorithm for influence maximization in social networks”, The International Conference of World Wide Web, 2011, 47–48, 11
S. Cheng, H. Shen, J. Huang, G. Zhang, X. Cheng, “Staticgreedy: Solving the scalability-accuracy dilemma in influence maximization”, ACM (International Conference on Information and Knowledge Management), 2013, 13.
W. Chen, Y. Wang, S. Yang, “Efficient influence maximization in social networks”, ACM(Knowledge Discovery & Data Mining), 2009, 199–208, 09.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Highlights in Science, Engineering and Technology
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
