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 条

[41] Improved collective influence of finding most influential nodes based on disjoint-set reinsertion (vol 8, 14503, 2018)
Zhu, Fengkuangtian
SCIENTIFIC REPORTS, 2018, 8
[42] A linear-time algorithm for finding an edge-partition with max-min ratio at most two
Chu, An-Chiang
Wu, Bang Ye
Chao, Kun-Mao
DISCRETE APPLIED MATHEMATICS, 2013, 161 (7-8) : 932 - 943
[43] FAST K NEAREST NEIGHBOR FINDING ALGORITHM BASED ON THE ORDERED PARTITION.
Kim, Baek S.
Park, Song B.
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1986, PAMI-8 (06) : 761 - 766
[44] A fast weak motif-finding algorithm based on community detection in graphs
Caiyan Jia
Matthew B Carson
Jian Yu
BMC Bioinformatics, 14
[45] Reconfigurable Antenna Array Direction Finding System Based on a Fast Search Algorithm
Liu, Chunxi
Peng, Dongliang
Chen, Zhikun
Wu, Yong
Wang, Binan
SENSORS, 2021, 21 (14)
[46] A fast weak motif-finding algorithm based on community detection in graphs
Jia, Caiyan
Carson, Matthew B.
Yu, Jian
BMC BIOINFORMATICS, 2013, 14
[47] A kind of fast image edge detection algorithm based on dynamic threshold value
1600, International Frequency Sensor Association, 46 Thorny Vineway, Toronto, ON M2J 4J2, Canada (23):
[48] CMfinder - a covariance model based RNA motif finding algorithm
Yao, ZZ
Weinberg, Z
Ruzzo, WL
BIOINFORMATICS, 2006, 22 (04) : 445 - 452
[49] Centrality measure in social networks based on linear threshold model
Riquelme, Fabian
Gonzalez-Cantergiani, Pablo
Molinero, Xavier
Serna, Maria
KNOWLEDGE-BASED SYSTEMS, 2018, 140 : 92 - 102
[50] A FAST MULTIVIEW VIDEO CODING ALGORITHM BASED ON DYNAMIC MULTI-THRESHOLD
Peng, Zongju
Jiang, Gangyi
Yu, Mei
ICME: 2009 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO, VOLS 1-3, 2009, : 113 - +

← 1 2 3 4 5 →