New trends in influence maximization models

M Azaouzi, W Mnasri, LB Romdhane - Computer Science Review, 2021 - Elsevier
The growing popularity of social networks is providing a promising opportunity for different
practical applications. The influence analysis is an essential technique supporting the …

Influential nodes detection in dynamic social networks: A survey

N Hafiene, W Karoui, LB Romdhane - Expert Systems with Applications, 2020 - Elsevier
The influence maximization problem has gained increasing attention in recent years.
Previous research focuses on the development of algorithms to analyze static social …

A survey on influence maximization in a social network

S Banerjee, M Jenamani, DK Pratihar - Knowledge and Information …, 2020 - Springer
Given a social network with diffusion probabilities as edge weights and a positive integer k,
which k nodes should be chosen for initial injection of information to maximize the influence …

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 …

Ranking nodes in complex networks based on local structure and improving closeness centrality

C Salavati, A Abdollahpouri, Z Manbari - Neurocomputing, 2019 - Elsevier
In complex networks, the nodes with most spreading ability are called influential nodes. In
many applications such as viral marketing, identification of most influential nodes and …

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 …

DDSE: A novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks

L Cui, H Hu, S Yu, Q Yan, Z Ming, Z Wen… - Journal of Network and …, 2018 - Elsevier
Influence maximization (IM) is the problem of finding a small subset of nodes in a social
network so that the number of nodes influenced by this subset can be maximized. Influence …

Identifying influential spreaders in complex networks based on improved k-shell method

M Wang, W Li, Y Guo, X Peng, Y Li - Physica A: Statistical Mechanics and …, 2020 - Elsevier
Identifying influential spreaders in complex networks is a fundamental network project. It has
drawn great attention in recent years because of its great theoretical significance and …

Influential spreaders identification in complex networks with improved k-shell hybrid method

G Maji, A Namtirtha, A Dutta, MC Malta - Expert Systems with Applications, 2020 - Elsevier
Identifying influential spreaders in a complex network has practical and theoretical
significance. In applications such as disease spreading, virus infection in computer …

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 …