Selecting Seeds for Competitive Influence Spread Maximization in Social Networks  

作　　者：Hong Wu Weiyi Liu Kun Yue Jin Li Weipeng Huang 

机构地区：[1]School of Information Science and Engineering,Yunnan University,Kunming,China [2]School of Computer Science and Engineering,Qujing Normal University,Qujing,China [3]School of Software,Yunnan University,Kunming,China

出　　处：《国际计算机前沿大会会议论文集》2016年第1期153-155,共3页International Conference of Pioneering Computer Scientists, Engineers and Educators（ICPCSEE）

基　　金：This paper was supported by the National Natural Science Foundation of China (61472345, 61562091), the Natural Science Foundation of Yunnan Province (2014FA023,2013FB010), the Program for Innovative Research Team in Yunnan University (XT412011), the Program for Excellent Young Talents of Yunnan University (XT412003), Yunnan Provincial Foundation for Leaders of Disciplines in Science and Technology (2012HB004), and the Research Foundation of the Educational Department of Yunnan Province (2014C134Y).

摘　　要：There exist two or more competing products in viral marketing, and the companies can exploit the social interactions of users to propagate the awareness of products. In this paper, we focus on selecting seeds for maximizing the competitive influence spread in social networks. First, we establish the possible graphs based on the propagation probability of edges, and then we use the competitive influence spread model (CISM) to model the competitive spread under the possible graph. Further, we consider the objective function of selecting k seeds of one product under the CISM when the seeds of another product have been known, which is monotone and submodular, and thus we use the CELF (cost-effective lazy forward) algorithm to accelerate the greedy algorithm that can approximate the optimal with 1 ? 1/e. Experimental results verify the feasibility and effectiveness of our method.

关 键 词：Social networks COMPETITIVE INFLUENCE SPREAD Possible graph SUBMODULARITY CELF algorithm 

分 类 号：C5[社会学]