Abstract
The influence maximization problem aims to select a small set of influential nodes,termed a seed set,to maximize their influence coverage in social networks.Although the methods that are based on a greedy strategy can obtain good accuracy,they come at the cost of enormous computational time,and are therefore not applicable to practical scenarios in large-scale networks.In addition,the centrality heuristic algorithms that are based on network topology can be completed in relatively less time.However,they tend to fail to achieve satisfactory results because of drawbacks such as overlapped influence spread.In this work,we propose a discrete two-stage metaheuristic optimization combining quantum-behaved particle swarm optimization with Lévy flight to identify a set of the most influential spreaders.According to the framework,first,the particles in the population are tasked to conduct an exploration in the global solution space to eventually converge to an acceptable solution through the crossover and replacement operations.Second,the Lévy flight mechanism is used to perform a wandering walk on the optimal candidate solution in the population to exploit the potentially unidentified influential nodes in the network.Experiments on six real-world social networks show that the proposed algorithm achieves more satisfactory results when compared to other well-known algorithms.
基金项目
Zhejiang Provincial Natural Science Foundation(LQ20F020011)
Gansu Provincial Foundation for Distinguished Young Scholars(23JRRA766)
National Natural Science Foundation of China(62162040)
National Key Research and Development Program of China(2020YFB1713600)
万方数据