|
|
|
| Genetic Algorithm-based Low Redundant Hypergraph Influence Maximization |
| WANG Zhipinga, ZHAO Jialea, LIU Kaib, ZHANG Haifenga
|
| a. School of Mathematical Sciences; b. Institutes of Physical Science and Information Technology, Anhui University, Hefei 230039 |
|
|
|
|
Abstract The influence maximization problem in hypergraphs has wide-ranging applications across various fields. Existing methods either inadequately address the redundancy of influence between nodes or only rely on a single metric for initial node ranking, which may fail to accurately capture the true propagation values of nodes. To simultaneously consider both influence redundancy between nodes and the actual propagation values of nodes, this paper proposes a Low Redundant Hypergraph based on the Genetic Algorithm (LR-HGA), which takes into account these two aspects in the selection and crossover operations of genetic algorithm. Experimental results on six real hypergraph networks using the SI propagation model defined on hypergraphs show that the seed set obtained by this algorithm generally has a wider influence spread compared to state-of-the-art benchmark algorithms.
|
|
Received: 11 April 2024
Published: 03 June 2025
|
|
|
|
|
|
|
|
|
