1. Influence maximization algorithm based on Gaussian propagation model.
- Author
-
Li, WeiMin, Li, Zheng, Luvembe, Alex Munyole, and Yang, Chao
- Subjects
- *
GREEDY algorithms , *ALGORITHMS , *INFORMATION dissemination , *INFORMATION networks , *SOCIAL networks - Abstract
• A Gaussian propagation model is explored to improve Influence Maximization. • Multi-dimensional space modeling is constructed by offset, motif, and degree dimensions. • An improved CELF algorithm to accelerate the efficiency of the greedy algorithm. The influence of each entity in a network is a crucial index of the network information dissemination. Greedy influence maximization algorithms suffer from time efficiency and scalability issues. In contrast, heuristic influence maximization algorithms improve efficiency, but they cannot guarantee accurate results. Considering this, this paper proposes a Gaussian propagation model based on the social networks. Multi-dimensional space modeling is constructed by offset, motif, and degree dimensions for propagation simulation. This space's circumstances are controlled by some influence diffusion parameters. An influence maximization algorithm is proposed under this model, and this paper uses an improved CELF algorithm to accelerate the influence maximization algorithm. Further, the paper evaluates the effectiveness of the influence maximization algorithm based on the Gaussian propagation model supported by theoretical proofs. Extensive experiments are conducted to compare the effectiveness and efficiency of a series of influence maximization algorithms. The results of the experiments demonstrate that the proposed algorithm shows significant improvement in both effectiveness and efficiency. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF