Influence and Profit: Two Sides of the Coin

被引:24
作者
Zhu, Yuqing [2 ]
Lu, Zaixin [3 ]
Bi, Yuanjun [2 ]
Wu, Weili [2 ]
Jiang, Yiwei [4 ]
Li, Deying [1 ]
机构
[1] Renmin Univ China, Sch Informat, Beijing, Peoples R China
[2] Univ Texas Dallas, Dept Comp Sci, Dallas, TX 75230 USA
[3] Texas Southern Univ, NSF Ctr Res Complex Networks, Houston, TX 77004 USA
[4] Zhejiang Sci Tech Univ, Dept Math, Hangzhou, Zhejiang, Peoples R China
来源
2013 IEEE 13TH INTERNATIONAL CONFERENCE ON DATA MINING (ICDM) | 2013年
基金
中国国家自然科学基金; 美国国家科学基金会;
关键词
Influence maximization; profit maximization; social networks; IC model; LT model;
D O I
10.1109/ICDM.2013.40
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Influence maximization problem is to find a set of seeds in social networks such that the cascade influence is maximized. Traditional models assume all nodes are willing to spread the influence once they are influenced, and they ignore the disparity between influence and profit of a product. In this paper by considering the role that price plays in viral marketing, we propose price related (PR) frame that contains PR-I and PR-L models for classic IC and LT models respectively, which is a pioneer work. We find that influence and profit are like two sides of the coin, high price hinders the influence propagation and to enlarge the influence some sacrifice on profit is inevitable. We propose Balanced Influence and Profit (BIP) maximization problem. We prove the NP-hardness of BIP maximization under PR-I and PR-L model. Unlike influence maximization, the BIP objective function is not monotone. Despite the non-monotony, we show BIP objective function is submodular under certain conditions. Two unbudgeted greedy algorithms separately are devised. We conduct simulations on real-world datasets and evaluate the superiority of our algorithms over existing ones.
引用
收藏
页码:1301 / 1306
页数:6
相关论文
共 12 条
[1]  
[Anonymous], P 10 IEEE INT C DAT
[2]  
Arthur D., 2009, CORR
[3]  
Chen W, 2010, P 16 ACM SIGKDD INT, P1029, DOI DOI 10.1145/1835804.1835934
[4]  
Domingos P., 2001, KDD-2001. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P57, DOI 10.1145/502512.502525
[5]  
Hartline Jason D., 2008, P 17 INT C WORLD WID, P189, DOI 10.1145/1367497.1367524
[6]  
Kempe D., 2015, PROC ACM SIGKDD INT, V11, P105
[7]   SEQUENTIAL MINIMAX SEARCH FOR A MAXIMUM [J].
KIEFER, J .
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1953, 4 (03) :502-506
[8]   The value of knowing a demand curve: Bounds on regret for online posted-price auctions [J].
Kleinberg, R ;
Leighton, T .
44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2003, :594-605
[9]   Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters [J].
Leskovec, Jure ;
Lang, Kevin J. ;
Dasgupta, Anirban ;
Mahoney, Michael W. .
INTERNET MATHEMATICS, 2009, 6 (01) :29-123
[10]  
Lu W., 2012, P 12 IEEE INT C DAT