Influence Maximization on Social Graphs: A Survey

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 key algorithmic problem in social influence analysis. Due to its immense application potential and enormous technica...

Full description

Bibliographic Details

Published in:	IEEE transactions on knowledge and data engineering Vol. 30; no. 10; pp. 1852 - 1872
Main Authors:	Li, Yuchen, Fan, Ju, Wang, Yanhao, Tan, Kian-Lee
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.10.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	algorithm design Algorithms Classification algorithms Computational modeling Diffusion processes Influence maximization information diffusion Information dissemination Integrated circuit modeling Maximization Social network services Social networks Stochastic processes Taxonomy
ISSN:	1041-4347, 1558-2191
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!