Community-based influence maximization for viral marketing

被引:45
作者
Huang, Huimin [1 ]
Shen, Hong [1 ,2 ]
Meng, Zaiqiao [1 ]
Chang, Huajian [1 ]
He, Huaiwen [1 ]
机构
[1] Sun Yat Sen Univ, Sch Data & Comp Sci, Guangzhou, Guangdong, Peoples R China
[2] Univ Adelaide, Sch Comp Sci, Adelaide, SA, Australia
基金
国家重点研发计划; 澳大利亚研究理事会;
关键词
Social networks; Viral marketing; Influence maximization; Latent variable model;
D O I
10.1007/s10489-018-1387-8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Derived from the idea of word-to-mouth advertising and with applying information diffusion theory, viral marketing attracts wide research interests because of its business value. As an effective marketing strategy, viral marketing is to select a small set of initial users based on trust among close social circles of friends or families so as to maximize the spread of influence in the social network. In this paper, we propose a new community-based influence maximization method for viral marketing that integrates community detection into influence diffusion modeling, instead of performing community detection independently, to improve the performance. We first build a comprehensive latent variable model which captures community-level topic interest, item-topic relevance and community membership distribution of each user, and we propose a collapsed Gibbs sampling algorithm to train the model. Then we infer community-to-community influence strength using topic-irrelevant influence and community topic interest, and further infer user-to-user influence strength using community-to-community influence strength and community membership distribution of each user. Finally we propose a community-based heuristic algorithm to mine influential nodes that selects the influential nodes with a divide-and-conquer strategy, considering both topic-aware and community-relevant to enhance quality and improve efficiency. Extensive experiments are conducted to evaluate effectiveness and efficiency of our proposals. The results validate our ideas and show the superiority of our method compared with state-of-the-art influence maximization algorithms.
引用
收藏
页码:2137 / 2150
页数:14
相关论文
共 44 条
[1]  
[Anonymous], 2010, Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
[2]  
[Anonymous], 2012, 26 AAAI C ART INT
[3]   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
[4]   Scalable Topic-Specific Influence Analysis on Microblogs [J].
Bi, Bin ;
Tian, Yuanyuan ;
Sismanis, Yannis ;
Balmin, Andrey ;
Cho, Junghoo .
WSDM'14: PROCEEDINGS OF THE 7TH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2014, :513-522
[5]   Latent Dirichlet allocation [J].
Blei, DM ;
Ng, AY ;
Jordan, MI .
JOURNAL OF MACHINE LEARNING RESEARCH, 2003, 3 (4-5) :993-1022
[6]  
Cao Tianyu., 2010, P 2010 ACM S APPL CO, P1088, DOI 10.1145/1774088.1774314
[7]  
Cha YC, 2012, SIGIR 2012: PROCEEDINGS OF THE 35TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, P565, DOI 10.1145/2348283.2348360
[8]   Efficient Influence Maximization in Social Networks [J].
Chen, Wei ;
Wang, Yajun ;
Yang, Siyu .
KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2009, :199-207
[9]  
Chen Wei, 2010, P 16 ACM SIGKDD INT, P1029, DOI DOI 10.1145/1835804.1835934
[10]   CIM: Community-Based Influence Maximization in Social Networks [J].
Chen, Yi-Cheng ;
Zhu, Wen-Yuan ;
Peng, Wen-Chih ;
Lee, Wang-Chien ;
Lee, Suh-Yin .
ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2014, 5 (02)