.png){kind=icon}
.png){kind=icon}
Return
HIDE-EA: An Influence Decaying Estimation-based Evolutionary Algorithm for Hypergraph Dynamic Influence Maximization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2026.102363.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
With the rapid growth of social networks, user interactions have become increasingly complex, making traditional binary relationship-based methods inadequate for studying group social relationships. Moreover, existing research has overlooked the dynamic decay of information propagation among users. To address this, we define the Hypergraph Dynamic Influence Maximization (HDIM) problem and develop a Hypergraph Dynamic Susceptible–Infected (HDSI) model to capture the dynamic decay of information spread. For solving HDIM problem, we propose a Hypergraph Influence Decaying Estimation-based Evolutionary Algorithm (HIDE-EA). This approach formulates an objective function using probabilistic influence decaying estimation and iteratively optimizes the node set as the decision variable, effectively expanding influence propagation in hypergraphs while greatly reducing the computational cost of Monte Carlo simulations. We also design a Node Influence Decaying Estimation (NIDE)-based initialization method to accelerate convergence. Experiments on hypergraph datasets show that HIDE-EA significantly shortens computation time while achieving results comparable to the greedy algorithm, and outperforms other baseline methods.
Keywords:
Hypergraph Dynamic Influence Maximization
HDSI model
HIDE-EA
influence decaying estimation
evolutionary algorithm
Journal
IF:
8.5
Papers:
2.1K
Citations:
1.0W