Research Article
An Influence Maximization Algorithm Based on Real-Time and De-superimposed Diffusibility
@INPROCEEDINGS{10.1007/978-3-030-30146-0_37, author={Yue Ren and Xinyuan Zhang and Liting Xia and Yongze Lin and Yue Zhao and Weimin Li}, title={An Influence Maximization Algorithm Based on Real-Time and De-superimposed Diffusibility}, proceedings={Collaborative Computing: Networking, Applications and Worksharing. 15th EAI International Conference, CollaborateCom 2019, London, UK, August 19-22, 2019, Proceedings}, proceedings_a={COLLABORATECOM}, year={2019}, month={8}, keywords={Social network Influence maximization Diffusibility}, doi={10.1007/978-3-030-30146-0_37} }- Yue Ren
Xinyuan Zhang
Liting Xia
Yongze Lin
Yue Zhao
Weimin Li
Year: 2019
An Influence Maximization Algorithm Based on Real-Time and De-superimposed Diffusibility
COLLABORATECOM
Springer
DOI: 10.1007/978-3-030-30146-0_37
Abstract
Influence maximization is to find a small number of seed nodes in the network that maximize their influence on the network. Existing algorithms select a seed node with the greatest influence. This will inevitably have an influence on mutual coverage, which will have a more or less negative impact on the final results and reduce the performance of the algorithm. In this paper, Node Diffusibility is proposed, and it is updated in real time and eliminated the deviation caused by its overlay. On the basis of traditional calculation of node influence, more attention was paid to the influence of a node’s neighboring nodes rather than to the characteristics of the nodes themselves. The proposed algorithm was evaluated by experiments conducted on selected real data sets. Compared with the classical ranking-based algorithms, MaxDegree and PageRank, the proposed algorithm achieved better results in terms of efficiency and time complexity.
