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 …

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 …

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 …

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 …

FIP: A fast overlapping community-based Influence Maximization Algorithm using probability coefficient of global diffusion in social networks

A Bouyer, HA Beni, B Arasteh, Z Aghaee… - Expert systems with …, 2023 - Elsevier
Influence maximization is the process of identifying a small set of influential nodes from a
complex network to maximize the number of activation nodes. Due to the critical issues such …

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 MCDM integrated adaptive simulated annealing approach for influence maximization in social networks

TK Biswas, A Abbasi, RK Chakrabortty - Information Sciences, 2021 - Elsevier
Abstract The Influence Maximization (IM) problem aims to identify a small subset of nodes
that have the most influence spread in a network. Although it is an NP-hard problem, the …

[HTML][HTML] Identifying influential nodes in social networks via community structure and influence distribution difference

Z Zhang, X Li, C Gan - Digital Communications and Networks, 2021 - Elsevier
This paper aims to effectively solve the problem of the influence maximization in social
networks. For this purpose, an influence maximization method that can identify influential …

A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks

J Tang, R Zhang, P Wang, Z Zhao, L Fan… - Knowledge-Based Systems, 2020 - Elsevier
Influence maximization problem aims to select a subset of k most influential nodes from a
given network such that the spread of influence triggered by the seed set will be maximum …

Efficient algorithms for influence maximization in social networks

YC Chen, WC Peng, SY Lee - Knowledge and information systems, 2012 - Springer
In recent years, due to the surge in popularity of social-networking web sites, considerable
interest has arisen regarding influence maximization in social networks. Given a social …