[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 …

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 …

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 …

Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks

HT Nguyen, MT Thai, TN Dinh - … of the 2016 international conference on …, 2016 - dl.acm.org
Influence Maximization (IM), that seeks a small set of key users who spread the influence
widely into the network, is a core problem in multiple domains. It finds applications in viral …

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 …

A survey on influence maximization: From an ml-based combinatorial optimization

Y Li, H Gao, Y Gao, J Guo, W Wu - ACM Transactions on Knowledge …, 2023 - dl.acm.org
Influence Maximization (IM) is a classical combinatorial optimization problem, which can be
widely used in mobile networks, social computing, and recommendation systems. It aims at …

Online processing algorithms for influence maximization

J Tang, X Tang, X ** 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 …

Gcomb: Learning budget-constrained combinatorial algorithms over billion-sized graphs

S Manchanda, A Mittal, A Dhawan… - Advances in …, 2020 - proceedings.neurips.cc
There has been an increased interest in discovering heuristics for combinatorial problems
on graphs through machine learning. While existing techniques have primarily focused on …