Influence maximization based on node attraction model
File version
Author(s)
Jiang, J
Li, W
Wang, C
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
Size
File type(s)
Location
Fukuoka, Japan
License
Abstract
In the research of the problem of maximizing the influence of social networks, a propagation model based on the attraction between nodes is proposed for the calculation of node information propagation influence. In this study, we model the node properties of the network and use it to define the direct attraction and cumulative attraction, in which we consider the change and attenuation of the node influence. Also, we discuss the gravitational features of the nodes to establish a propagation method based on the independent cascade model. The probability of the node attraction is designed for activation between nodes. Finally, experiments on actual data sets show that the influence under this method is better than other methods.
Journal Title
Conference Title
Proceedings - IEEE 17th International Conference on Dependable, Autonomic and Secure Computing, IEEE 17th International Conference on Pervasive Intelligence and Computing, IEEE 5th International Conference on Cloud and Big Data Computing, 4th Cyber Science and Technology Congress, DASC-PiCom-CBDCom-CyberSciTech 2019
Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject
Distributed computing and systems software
Persistent link to this record
Citation
Wang, G; Jiang, J; Li, W; Wang, C, Influence maximization based on node attraction model, Proceedings - IEEE 17th International Conference on Dependable, Autonomic and Secure Computing, IEEE 17th International Conference on Pervasive Intelligence and Computing, IEEE 5th International Conference on Cloud and Big Data Computing, 4th Cyber Science and Technology Congress, DASC-PiCom-CBDCom-CyberSciTech 2019, 2019, pp. 437-441