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...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on knowledge and data engineering Ročník 30; číslo 10; s. 1852 - 1872
Hlavní autori:	Li, Yuchen, Fan, Ju, Wang, Yanhao, Tan, Kian-Lee
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.10.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!