Community-diversified influence maximization in social networks

被引:177
作者
Li, Jianxin [1 ]
Cai, Taotao [1 ]
Deng, Ke [2 ]
Wang, Xinjue [2 ]
Sellis, Timos [3 ]
Xia, Feng [4 ]
机构
[1] Deakin Univ, Sch Informat Technol, Geelong, Vic, Australia
[2] RMIT Univ, Dept Comp Sci & Informaton Technol, Melbourne, Vic, Australia
[3] Swinburne Univ Technol, Data Sci Res Inst, Hawthorn, Vic, Australia
[4] Federat Univ Australia, Sch Sci Engn & Informat Technol, Ballarat, Vic, Australia
关键词
Social community; Influence maximization; Diversified influence propagation; TIME; SEARCH; PATH;
D O I
10.1016/j.is.2020.101522
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
To meet the requirement of social influence analytics in various applications, the problem of influence maximization has been studied in recent years. The aim is to find a limited number of nodes (i.e., users) which can activate (i.e. influence) the maximum number of nodes in social networks. However, the community diversity of influenced users is largely ignored even though it has unique value in practice. For example, the higher community diversity reduces the risk of marketing campaigns as you should not put all your eggs in one basket; the diversity can also prolong the effect of a marketing campaign in the future promotion. Motivated by this observation, this paper investigates Community-diversified Influence Maximization (CDIM) problem to efficiently find k nodes such that, if a message is initiated and spread by the k nodes, the number as well as the community diversity of the activated nodes will be maximized at the end of propagation process. This work proposes a metric to measure the community-diversified influence and addresses a series of computational challenges. Two algorithms and an innovative CPSP-Tree index have been developed. This study also investigates the situation that community definition is not specified. The effectiveness and efficiency of the proposed solutions have been verified through extensive experimental studies on five real-world social network datasets. (C) 2020 Elsevier Ltd. All rights reserved.
引用
收藏
页数:12
相关论文
共 47 条
[1]  
[Anonymous], 2012, P 29 INT C MACH LEAR
[2]  
[Anonymous], 2011, P 20 INT C WORLD WID
[3]  
Aslay Cigdem, 2014, P 17 INT C EXT DAT T, P295
[4]   Topic-aware Social Influence Propagation Models [J].
Barbieri, Nicola ;
Bonchi, Francesco ;
Manco, Giuseppe .
12TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM 2012), 2012, :81-90
[5]   Fast unfolding of communities in large networks [J].
Blondel, Vincent D. ;
Guillaume, Jean-Loup ;
Lambiotte, Renaud ;
Lefebvre, Etienne .
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
[6]   FINDING ALL CLIQUES OF AN UNDIRECTED GRAPH [H] [J].
BRON, C ;
KERBOSCH, J .
COMMUNICATIONS OF THE ACM, 1973, 16 (09) :575-577
[7]   Online Topic-Aware Influence Maximization [J].
Chen, Shuo ;
Fan, Ju ;
Li, Guoliang ;
Feng, Jianhua ;
Tan, Kian-lee ;
Tang, Jinhui .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2015, 8 (06) :666-677
[8]  
CHEN W, 2014, ABS14030057 CORR
[9]  
Chen Wei, 2010, P 16 ACM SIGKDD INT, P1029
[10]  
Dang V, 2012, SIGIR 2012: PROCEEDINGS OF THE 35TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, P65, DOI 10.1145/2348283.2348296