.png){kind=icon}
返回
Sequential seeding to optimize influence diffusion in a social network
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2016.04.025.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The problem of node seeding for optimizing influence diffusion in a social network can be applied in many fields, and thus has drawn much attention. In real life, because of a variety of reasons, decision maker needs to make a sequence of decisions about how to select the seeded nodes. In this paper, we study the problem of sequentially seeding nodes in a social network such that the complete influence time is minimized. We formulate a Markov decision process to describe the problem and embed a modified greedy search method into an online algorithm to solve the Markov decision process. Numerical experiments are performed to show the effectiveness of the proposed online algorithm. (C) 2016 Elsevier B.V. All rights
Keyword:
Social networks
Complete influence time
Markov decision process
Online algorithm
Modified greedy algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
.png){kind=icon}
Solar UVB measurements with the double‐ and single‐monochromator Brewer ozone spectrophotometers
PREAI
分享收藏
查看更多内容