期刊
KNOWLEDGE AND INFORMATION SYSTEMS
卷 62, 期 9, 页码 3417-3455出版社
SPRINGER LONDON LTD
DOI: 10.1007/s10115-020-01461-4
关键词
Social networks; Influence maximization; Approximation algorithm; Greedy strategy
资金
- Ministry of Human Resource and Development (MHRD), Government of India [5-5/2014-TS.VII]
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 in the network? This problem is popularly known as the Social Influence Maximization Problem (SIM Problem). This is an active area of research in computational social network analysis domain, since one and half decades or so. Due to its practical importance in various domains, such as viral marketing, target advertisement and personalized recommendation, the problem has been studied in different variants, and different solution methodologies have been proposed over the years. This paper presents a survey on the progress in and around SIM Problem. At last, it discusses current research trends and future research directions as well.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据