arrow
返回

An improved clustering based multi-objective evolutionary algorithm for influence maximization under variable-length solutions

delete2022-11-01
delete3
PRE
AI
T
Tarun Kumer Biswas *
A
Alireza Abbasi
R
Ripon K. Chakrabortty
DOI:10.1016/j.knosys.2022.109856delete
delete原文链接
delete分享
delete收藏
摘要

摘要

En 中文
Knowledge of influential actors on real networks is essential for designing policies for boosting the spread of positive things (e.g., news and innovation) and preventing the spread of negative things (e.g., disease and misinformation). Finding an optimum set of nodes with maximum influence, known as Influence Maximization (IM), aims to achieve this, which requires consideration of both magnitude of the influence spread and other important factors such as the cost and size of the seed set. However, most previous research has viewed the IM problem as a single objective problem, wherein decision-makers are required to make decisions on other criteria without having a clear view of them. In this study, the IM problem is formulated as a Multi-objective Influence Maximization Problem (MIMP) with three conflicting objectives and real-world constraints. An improved version of theta-Dominance based Evolutionary Algorithm, named as theta DEA-II, is proposed to solve the MIMP. To achieve a better balance between divergence and convergence of the proposed theta DEA-II, a gap-based selection operator is introduced along with some modifications in the sorting and normalization process. Moreover, because the proposed MIMP deals with variable-length solutions, all of the investigated algorithms, including the baseline algorithms, are constructed with a novel crossover mechanism capable of producing offsprings that are different in size from their parents. Experimental results on six real-world datasets demonstrate that the proposed MIMP formulation as well as the theta DEA-II algorithm are effective for finding an optimal solution. (C) 2022 Elsevier B.V. All rights reserved.
Keyword:
Influence maximization
Multi-objective evolutionary algorithm
Variable-length solutions
?-dominance
Social network analysis

期刊

K
Knowledge-Based Systems
IF:
7.6
论文数:
1.3W
被引数:
5.9W

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
Bio-inspired computation: Where we stand and what's next生物启发的计算: 我们的立场和下一步是什么
err2019-08-01
err438
errOAAI
errDel Ser, Javier; Osaba, Eneko; Molina, Daniel; Yang, Xin-She; Salcedo-Sanz, Sancho; Camacho, David; Das, Swagatam; Suganthan, Ponnuthurai N.; Coello Coello, Carlos A.; Herrera, Francisco
err分享
err收藏
err分享
err收藏
学者 查看更多内容