An Influence Maximization Algorithm for Dynamic Social Networks Based on Effective Links
The connection between users in social networks can be maintained for a certain period of time, and the static network structure formed provides the basic conditions for various kinds of research, especially for discovering customer groups that can generate great influence, which is important for pr...
Main Authors: | Baojun Fu, Jianpei Zhang, Hongna Bai, Yuting Yang, Yu He |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-06-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/24/7/904 |
Similar Items
-
On the Reselection of Seed Nodes in Independent Cascade Based Influence Maximization
by: Ali Vardasbi, et al.
Published: (2018-12-01) -
A Differential Evolutionary Influence Maximization Algorithm Based on Network Discreteness
by: Baojun Fu, et al.
Published: (2022-07-01) -
Link prediction for ex ante influence maximization on temporal networks
by: Eric Yanchenko, et al.
Published: (2023-09-01) -
Maximization influence in dynamic social networks and graphs
by: Gkolfo I. Smani, et al.
Published: (2022-09-01) -
HEDV-Greedy: An Advanced Algorithm for Influence Maximization in Hypergraphs
by: Haosen Wang, et al.
Published: (2024-03-01)