计算机科学
数学优化
粒子群优化
最大化
集合(抽象数据类型)
帕累托原理
趋同(经济学)
多目标优化
观点
贪婪算法
算法
机器学习
数学
艺术
视觉艺术
经济
经济增长
程序设计语言
作者
Ping Wang,Ruisheng Zhang
标识
DOI:10.1093/comjnl/bxad128
摘要
Abstract The influence maximization (IM) problem has received great attention in the field of social network analysis, and its analysis results can provide reliable basis for decision makers when promoting products or political viewpoints. IM problem aims to select a set of seed users from social networks and maximize the number of users expected to be influenced. Most previous studies on the IM problem focused only on the single-objective problem of maximizing the influence spread of the seed set, ignoring the cost of the seed set, which causes decision makers to be unable to develop effective management strategies. In this work, the IM problem is formulated as a multi-objective IM problem that considers the cost of the seed set. An improved multi-objective particle swarm optimization (IMOPSO) algorithm is proposed to solve this problem. In the IMOPSO algorithm, the initialization strategy of Levy flight based on degree value is used to improve the quality of the initial solution, and the local search strategy based on greedy mechanism is designed to improve the Pareto Frontier distribution and promote algorithm convergence. Experimental results on six real social networks demonstrate that the proposed IMOPSO algorithm is effective, reducing runtime while providing competitive solutions.
科研通智能强力驱动
Strongly Powered by AbleSci AI