A fast algorithm for finding most influential people based on the linear threshold model

被引：87

作者：

Rahimkhani, Khadije ^{[1
]}

Aleahmad, Abolfazl ^{[1
]}

Rahgozar, Maseud ^{[1
]}

Moeini, Ali ^{[2
]}

机构：

[1] Univ Tehran, Control & Intelligent Proc Ctr Excellence, Sch Elect & Comp Engn, Database Res Grp, Tehran 14174, Iran

[2] Univ Tehran, Fac Engn Sci, Sch Engn, Tehran 14174, Iran

来源：

EXPERT SYSTEMS WITH APPLICATIONS | 2015年 / 42卷 / 03期

关键词：

Social networks; Influential people retrieval; Influence maximization; Linear threshold model; INFLUENCE MAXIMIZATION; COMPLEXITY;

D O I：

10.1016/j.eswa.2014.09.037

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：1353 / 1361

页数：9

共 50 条

[31] Finding a dominance order most consistent with a linear hierarchy: an improved algorithm for the I&SI method
Schmid, Volker S.
de Vries, Han
ANIMAL BEHAVIOUR, 2013, 86 (05) : 1097 - 1105
[32] Sampling Based Influence Maximization on Linear Threshold Model
Jia, Su
Chen, Ling
INTERNATIONAL CONFERENCE ON SUSTAINABLE DEVELOPMENT AND GREEN TECHNOLOGY (SDGT 2017), 2018, 989
[33] A Fast VQ Codebook Generation Algorithm Based on Otsu Histogram Threshold
Huang, Chang-Chin
Tsai, Du-Shiau
Horng, Gwoboa
FUNDAMENTA INFORMATICAE, 2009, 91 (3-4) : 563 - 579
[34] Fast selecting threshold algorithm based on one-dimensional entropy
Yang, S
Han, Y
Wang, CR
Wang, XW
Proceedings of 2005 International Conference on Machine Learning and Cybernetics, Vols 1-9, 2005, : 4554 - 4557
[35] A model of information process for algorithm of people finding behind optically opaque barriers
Sytnik O.V.
Radioelectronics and Communications Systems, 2008, 51 (07) : 396 - 399
[36] A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges
Ding, Wei
Xue, Guoliang
COMBINATORIAL OPTIMIZATION AND APPLICATIONS, 2011, 6831 : 98 - +
[37] A MODEL BASED ALGORITHM FOR FAST DPIV COMPUTING
陈添丁
李宏东
刘济林
顾伟康
Journal of Zhejiang University Science, 2001, (01) : 47 - 51
[38] A model based algorithm for fast DPIV computing
Chen Tian-ding
Li Hong-dong
Liu Ji-lin
Gu Wei-kang
Journal of Zhejiang University-SCIENCE A, 2001, 2 (1): : 46 - 50
[39] Finding influential nodes in complex networks based on Kullback-Leibler model within the neighborhood
Wang, Guan
Sun, Zejun
Wang, Tianqin
Li, Yuanzhe
Hu, Haifeng
SCIENTIFIC REPORTS, 2024, 14 (01):
[40] FAST LINEAR CONVOLUTION ALGORITHM BASED ON A RECTANGULAR TRANSFORMATION.
Titov, M.A.
Shpenov, M.N.
Savin, V.V.
Radioelectronics and Communications Systems (English translation of Izvestiya Vysshikh Uchebnykh Z, 1985, (08): : 75 - 77

← 1 2 3 4 5 →