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 条

[21] An Efficient Algorithm for Influence Maximization under Linear Threshold Model
Zhou, Shengfu
Yue, Kun
Fang, Qiyu
Zhu, Yunlei
Liu, Weiyi
26TH CHINESE CONTROL AND DECISION CONFERENCE (2014 CCDC), 2014, : 5352 - 5357
[22] Influence Maximization in Network by Genetic Algorithm on Linear Threshold Model
da Silva, Arthur Rodrigues
Rodrigues, Rodrigo Ferreira
Vieira, Vinicius da Fonseca
Xavier, Carolina Ribeiro
COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2018, PT I, 2018, 10960 : 96 - 109
[23] INCIM: A community-based algorithm for influence maximization problem under the linear threshold model
Bozorgi, Arastoo
Haghighi, Hassan
Zahedi, Mohammad Sadegh
Rezvani, Mojtaba
INFORMATION PROCESSING & MANAGEMENT, 2016, 52 (06) : 1188 - 1199
[24] Publisher Correction: Improved collective influence of finding most influential nodes based on disjoint-set reinsertion
Fengkuangtian Zhu
Scientific Reports, 8
[25] An algorithm for finding the most trusted path between entities based on selected mechanism
Zhou, Guo-Qiang
Zeng, Qing-Kai
Beijing Gongye Daxue Xuebao/Journal of Beijing University of Technology, 2010, 36 (05): : 679 - 684
[26] FTLTM: Fine Tuned Linear Threshold Model for gauging of influential user in complex networks for information diffusion
Kumaran P.
Sridhar R.
Muthuperumal S.
International Journal of Information Technology, 2023, 15 (7) : 3593 - 3604
[27] A FAST LINEAR CONVOLUTION ALGORITHM BASED ON THE RECTANGULAR TRANSFORM
TITOV, MA
SHPENOV, MN
SAVIN, VV
IZVESTIYA VYSSHIKH UCHEBNYKH ZAVEDENII RADIOELEKTRONIKA, 1985, 28 (08): : 84 - 86
[28] A tensor-based independent cascade model for finding influential links considering the similarity
Lin, Wei
Xu, Qikui
Li, Yifan
Xu, Li
CHAOS SOLITONS & FRACTALS, 2023, 173
[29] A fast algorithm for finding non-dominated set based on sorting
Zeng, San-You
Li, Hui
Ding, Li-Xin
Yao, Shu-Zhen
Xu, Zhong-Hua
Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2004, 41 (09): : 1565 - 1571
[30] A FAST K NEAREST NEIGHBOR FINDING ALGORITHM BASED ON THE ORDERED PARTITION
KIM, BS
PARK, SB
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1986, 8 (06) : 761 - 766

← 1 2 3 4 5 →