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 …

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 …

A multi-objective linear threshold influence spread model solved by swarm intelligence-based methods

R Olivares, F Muñoz, F Riquelme - Knowledge-Based Systems, 2021 - Elsevier
The influence maximization problem (IMP) is one of the most important topics in social
network analysis. It consists of finding the smallest seed of users that maximizes the …

A new community-based algorithm based on a “peak-slope-valley” structure for influence maximization on social networks

P Yang, L Zhao, Z Lu, L Zhou, F Meng, Y Qian - Chaos, Solitons & Fractals, 2023 - Elsevier
Influence Maximization (IM) is a key algorithmic problem that has been extensively studied
in social influence analysis, but most of existing researches either make sacrifices in solution …

CFIN: A community-based algorithm for finding influential nodes in complex social networks

MMD Khomami, A Rezvanian, MR Meybodi… - The Journal of …, 2021 - Springer
Influence maximization (IM) problem, a fundamental algorithmic problem, is the problem of
selecting a set of k users (refer as seed set) from a social network to maximize the expected …

CAOM: A community-based approach to tackle opinion maximization for social networks

Q He, X Wang, F Mao, J Lv, Y Cai, M Huang, Q Xu - Information Sciences, 2020 - Elsevier
Abstract Opinion Maximization Problem (OMP) targets at selecting a subset of influential
initial nodes and eventually generating the maximum opinion spread. The current OMP …

An adaptive heuristic clustering algorithm for influence maximization in complex networks

PL Yang, GQ Xu, Q Yu, JW Guo - Chaos: An Interdisciplinary Journal of …, 2020 - pubs.aip.org
Influence maximization research in the real world allows us to better understand, accelerate
spreading processes for innovations and products, and effectively analyze, predict, and …

Identification of top-k influential nodes based on enhanced discrete particle swarm optimization for influence maximization

J Tang, R Zhang, Y Yao, F Yang, Z Zhao, R Hu… - Physica A: Statistical …, 2019 - Elsevier
Influence maximization aims to select a subset of top-k influential nodes to maximize the
influence propagation, and it remains an open research topic of viral marketing and social …

A novel meta‐heuristic approach for influence maximization in social networks

B Chatterjee, T Bhattacharyya, KK Ghosh… - Expert …, 2023 - Wiley Online Library
Influence maximization in a social network focuses on the task of extracting a small set of
nodes from a network which can maximize the propagation in a cascade model. Though …

Fuzzy queries processing based on intuitionistic fuzzy social relational networks

SM Chen, Y Randyanto, SH Cheng - Information Sciences, 2016 - Elsevier
In this paper, we propose fuzzy queries processing techniques based on the proposed
intuitionistic fuzzy social relational network (IFSRN) model which contain positive …