.png){kind=icon}
返回
A fast algorithm for finding most influential people based on the linear threshold model
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2014.09.037.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Finding the most influential people is an NP-hard problem that has attracted many researchers in the field of social networks. The problem is also known as influence maximization and aims to find a number of people that are able to maximize the spread of influence through a target social network. In this paper, a new algorithm based on the linear threshold model of influence maximization is proposed. The main benefit of the algorithm is that it reduces the number of investigated nodes without loss of quality to decrease its execution time. Our experimental results based on two well-known datasets show that the proposed algorithm is much faster and at the same time more efficient than the state of the art algorithms. (C) 2014 Elsevier Ltd. All rights reserved.
Keyword:
Social networks
Influential people retrieval
Influence maximization
Linear threshold model
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Laparoscopic repair for intraoperative injury of the right hepatic artery during cholecystectomy
PREAI
分享收藏
查看更多内容