A survey on information diffusion in online social networks: Models and methods
M Li, X Wang, K Gao, S Zhang - Information, 2017 - mdpi.com
By now, personal life has been invaded by online social networks (OSNs) everywhere. They
intend to move more and more offline lives to online social networks. Therefore, online …
intend to move more and more offline lives to online social networks. Therefore, online …
A survey on influence maximization in a social network
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 …
which k nodes should be chosen for initial injection of information to maximize the influence …
Efficient algorithms for budgeted influence maximization on massive social networks
Given a social network G, a cost associated with each node, and a budget B, the budgeted
influence maximization (BIM) problem aims to find a set S of nodes, denoted as the seed set …
influence maximization (BIM) problem aims to find a set S of nodes, denoted as the seed set …
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 …
spreading processes for innovations and products, and effectively analyze, predict, and …
Efficient and effective influence maximization in social networks: a hybrid-approach
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 …
maximize their influence spread over a social network. Kempe et al. showed the problem to …