Selecting Seeds for Competitive Influence Spread Maximization in Social Networks

• 作者: Hong Wu Jin Li Kun Yue Weipeng Huang Weiyi Liu
• 来源期刊: 国际计算机前沿大会会议论文集
• 学科: 社会科学
• 关键词: Social networks COMPETITIVE INFLUENCE SPREAD Possible graph SUBMODULARITY CELF algorithm
• 年，卷（期）: 2016,（1）
• 页码范围: 153-155
• 页数: 3页
• 分类号: C5

摘要

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.