LAPSO-IM: A learning-based influence maximization approach for social networks

SS Singh, A Kumar, K Singh, B Biswas - Applied Soft Computing, 2019 - Elsevier
Online social networks play a pivotal role in the propagation of information and influence as
in the form of word-of-mouth spreading. Influence maximization (IM) is a fundamental …

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 …

A search space reduction-based progressive evolutionary algorithm for influence maximization in social networks

L Zhang, K Ma, H Yang, C Zhang… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
Influence maximization (IM) problem, which selects a subset of nodes from a social network
to maximize the influence spread, appeals to numerous scholars. Since the IM problem is …

MDER: modified degree with exclusion ratio algorithm for influence maximisation in social networks

S Kumar, D Lohia, D Pratap, A Krishna, BS Panda - Computing, 2022 - Springer
The online social network has become an integral part of our day to life and serves as an
excellent platform for sharing ideas, opinions, and products. Influence maximization (IM) is a …

TSIM: A two-stage selection algorithm for influence maximization in social networks

Q Liqing, G Chunmei, Z Shuang, T Xiangbo… - IEEE …, 2020 - ieeexplore.ieee.org
The influence maximization problem is aimed at finding a small subset of nodes in a
social./network to maximize the expected number of nodes influenced by these nodes …

Efficient and effective influence maximization in social networks: a hybrid-approach

YY Ko, KJ Cho, SW Kim - Information Sciences, 2018 - Elsevier
Influence Maximization (IM) is the problem of finding a seed set composed of k nodes that
maximize their influence spread over a social network. Kempe et al. showed the problem to …

An efficient path-based approach for influence maximization in social networks

S Kianian, M Rostamnia - Expert Systems with Applications, 2021 - Elsevier
It is no secret that the word-of-mouth has very powerful effect on the social interconnections,
but the question is “which factors influence the word-of-mouth effectiveness?” The answer …

PHG: A three-phase algorithm for influence maximization based on community structure

L Qiu, W Jia, J Yu, X Fan, W Gao - IEEE Access, 2019 - ieeexplore.ieee.org
The main purpose of influence maximization is to find a subset of key nodes that could
maximize the spread of information under a certain diffusion model. In recent years, many …

A pagerank-based heuristic algorithm for influence maximization in the social network

ZL Luo, WD Cai, YJ Li, D Peng - Recent Progress in Data Engineering and …, 2012 - Springer
The influence maximization is the problem of how to find a small subset of nodes (seed
nodes) that could maximize the spread of influence in social network. However, it proved to …

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 …