[HTML][HTML] Influence maximization frameworks, performance, challenges and directions on social network: A theoretical study

SS Singh, D Srivastva, M Verma, J Singh - Journal of King Saud University …, 2022 - Elsevier
The influence maximization (IM) problem identifies the subset of influential users in the
network to provide solutions for real-world problems like outbreak detection, viral marketing …

Influence maximization on social graphs: A survey

Y Li, J Fan, Y Wang, KL Tan - IEEE Transactions on Knowledge …, 2018 - ieeexplore.ieee.org
Influence Maximization (IM), which selects a set of k users (called seed set) from a social
network to maximize the expected number of influenced users (called influence spread), is a …

Community-diversified influence maximization in social networks

J Li, T Cai, K Deng, X Wang, T Sellis, F **a - Information Systems, 2020 - Elsevier
To meet the requirement of social influence analytics in various applications, the problem of
influence maximization has been studied in recent years. The aim is to find a limited number …

[HTML][HTML] Influence maximization in social networks: Theories, methods and challenges

Y Ye, Y Chen, W Han - Array, 2022 - Elsevier
Influence maximization (IM) is the process of choosing a set of seeds from a social network
so that the most individuals will be influenced by them. Calculating the social effect of a …

Influence maximization in social networks based on discrete particle swarm optimization

M Gong, J Yan, B Shen, L Ma, Q Cai - Information Sciences, 2016 - Elsevier
Influence maximization in social networks aims to find a small group of individuals, which
have maximal influence cascades. In this study, an optimization model based on a local …

SPIDER: A social computing inspired predictive routing scheme for softwarized vehicular networks

L Zhao, T Zheng, M Lin, A Hawbani… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
Software-defined vehicular network (SDVN) is a promising networking paradigm that can
provide intelligent information exchanges by separating network management and data …

TIFIM: A two-stage iterative framework for influence maximization in social networks

Q He, X Wang, Z Lei, M Huang, Y Cai, L Ma - Applied Mathematics and …, 2019 - Elsevier
Influence Maximization is an important problem in social networks, and its main goal is to
select some most influential initial nodes (ie, seed nodes) to obtain the maximal influence …

An efficient memetic algorithm for influence maximization in social networks

M Gong, C Song, C Duan, L Ma… - IEEE Computational …, 2016 - ieeexplore.ieee.org
Influence maximization is to extract a small set of nodes from a social network which
influences the propagation maximally under a cascade model. In this paper, we propose a …

On the upper bounds of spread for greedy algorithms in social network influence maximization

C Zhou, P Zhang, W Zang, L Guo - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
Influence maximization, defined as finding a small subset of nodes that maximizes spread of
influence in social networks, is NP-hard under both Independent Cascade (IC) and Linear …

Finding influential nodes in multiplex networks using a memetic algorithm

S Wang, J Liu, Y ** - IEEE transactions on cybernetics, 2019 - ieeexplore.ieee.org
In order to find the nodes with better propagation ability, a large body of studies on the
influence maximization problem has been conducted. Several influence spreading models …