Credit distribution for influence maximization in online social networks with node features

被引:9
作者
Deng, Xiaoheng [1 ]
Pan, Yan [1 ]
Shen, Hailan [1 ]
Gui, Jingsong [1 ]
机构
[1] Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China
关键词
Online social networks; influence evaluation; influence maximization; credit distribution; greedy algorithm; SPREAD; MEMORY;
D O I
10.3233/JIFS-169027
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Influence maximization is a problem of identifying a small set of highly influential individuals such that obtaining the maximum value of influence spread in social networks. How to evaluate the influence is essential to solve the influence maximization problem. Meanwhile, finding out influence propagation paths is one of key factors in the assessment of influence spread. However, since nodes' degrees are utilized by most of existent models and algorithms to estimate the activation probabilities on edges, node features are always ignored in the evaluation of influence ability for different users. In this paper, besides the node features, the Credit Distribution (CD) model is extended to incorporate the time-critical aspect of influence in online social networks. After assigning credit along with the action propagation paths, we pick up the node which has maximal marginal gain in each iteration to form the seed set. The experiments we performed on real datasets demonstrate that our approach is efficient and reasonable for identifying seed nodes, and the influence spread prediction by our approach is more accurate than that of original method which disregards node features in the influence evaluation and diffusion process.
引用
收藏
页码:979 / 990
页数:12
相关论文
共 26 条
[21]  
Saito K, 2008, LECT NOTES ARTIF INT, V5179, P67, DOI 10.1007/978-3-540-85567-5_9
[22]   Scalable influence maximization for independent cascade model in large-scale social networks [J].
Wang, Chi ;
Chen, Wei ;
Wang, Yajun .
DATA MINING AND KNOWLEDGE DISCOVERY, 2012, 25 (03) :545-576
[23]   Memory does not necessarily promote cooperation in dilemma games [J].
Wang, Tao ;
Chen, Zhigang ;
Li, Kenli ;
Deng, Xiaoheng ;
Li, Deng .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 395 :218-227
[24]  
Yang DN, 2013, 19TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING (KDD'13), P713
[25]   Maximizing the Spread of Positive Influence in Online Social Networks [J].
Zhang, Huiyuan ;
Dinh, Thang N. ;
Thai, My T. .
2013 IEEE 33RD INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS), 2013, :317-326
[26]   A linear threshold-hurdle model for product adoption prediction incorporating sOcial network effects [J].
Zhou, Feng ;
Jiao, Jianxin ;
Lei, Baiying .
INFORMATION SCIENCES, 2015, 307 :95-109