Profit Maximization for Viral Marketing in Online Social Networks: Algorithms and Analysis

被引:63
作者
Tang, Jing [1 ]
Tang, Xueyan [1 ]
Yuan, Junsong [2 ]
机构
[1] Nanyang Technol Univ, Sch Comp Sci & Engn, Singapore 639798, Singapore
[2] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
基金
新加坡国家研究基金会;
关键词
Online social networks; viral marketing; profit maximization; submodular maximization; INFLUENCE PROPAGATION;
D O I
10.1109/TKDE.2017.2787757
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Information can be disseminated widely and rapidly through Online Social Networks (OSNs) with "word-of-mouth" effects. Viral marketing is such a typical application in which new products or commercial activities are advertised by some seed users in OSNs to other users in a cascading manner. The selection of initial seed users yields a tradeoff between the expense and reward of viral marketing. In this paper, we define a general profit metric that naturally combines the benefit of influence spread with the cost of seed selection in viral marketing. We carry out a comprehensive study on finding a set of seed nodes to maximize the profit of viral marketing. We show that the profit metric is significantly different from the influence metric in that it is no longer monotone. This characteristic differentiates the profit maximization problem from the traditional influence maximization problem. We develop new seed selection algorithms for profit maximization with strong approximation guarantees. We also derive several upper bounds to benchmark the practical performance of an algorithm on any specific problem instance. Experimental evaluations with real OSN datasets demonstrate the effectiveness of our algorithms and techniques.
引用
收藏
页码:1095 / 1108
页数:14
相关论文
共 40 条
[1]  
[Anonymous], 2010, P ACM WSDM
[2]  
[Anonymous], 2013, P 26 INT C NEURAL IN
[3]  
[Anonymous], 2010, P 16 ACM SIGKDD INT, DOI DOI 10.1145/1835804.1835934
[4]  
[Anonymous], 2003, PROC ACM SIGKDD INT
[5]  
[Anonymous], 2008, INT C WORLD WIDE WEB, DOI DOI 10.1145/1367497.1367524
[6]  
[Anonymous], 2010, UAI
[7]   Viral Marketing Meets Social Advertising: Ad Allocation with Minimum Regret [J].
Aslay, Cigdem ;
Lu, Wei ;
Bonchi, Francesco ;
Goyal, Amit ;
Lakshmanan, Laks V. S. .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2015, 8 (07) :814-825
[8]   The Limitations of Optimization from Samples [J].
Balkanski, Eric ;
Rubinstein, Aviad ;
Singer, Yaron .
STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2017, :1016-1027
[9]   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
[10]  
Borgs C., 2014, P 25 ANN ACM SIAM S, P946, DOI [DOI 10.1137/1.9781611973402.70, 10.1137/1.9781611973402.70]