TOP PERSUADER PREDICTION FOR SOCIAL NETWORKS

被引:38
作者
Fang, Xiao [1 ]
Hu, Paul Jen-Hwa [2 ]
机构
[1] Univ Delaware, Lerner Coll Business & Econ, Newark, DE 19716 USA
[2] Univ Utah, David Eccles Sch Business, Salt Lake City, UT 84112 USA
关键词
Top persuader; influential user; machine learning; social network; social persuasion; social influence; entity similarity; structural equivalence; data-driven method; INFLUENTIAL USERS; CENTRALITY; CONTAGION; MODEL; DIFFUSION;
D O I
10.25300/MISQ/2018/13211
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Top persuaders in a social network are social entities whose adoption of a product or service will result in the largest numbers of other entities in the network adopting the same product or service. Predicting top persuaders is critical to an expanding array of important social network-centric applications, such as viral marketing, customer retention, and political message promotion. This study formulates the top persuader prediction problem and develops a novel method to predict top persuaders. Our method development is rooted in eminent social network theories that reveal several forces central to social persuasion, including social influence, entity similarity, and structural equivalence. Our method innovatively integrates these forces to predict top persuaders in a social network, in contrast to existing methods that primarily focus on social influence. Specifically, we introduce persuasion probability that denotes the likelihood of persuasion conditioned on these forces. We then propose how to estimate persuasion probabilities, develop an algorithm to predict top persuaders using the estimated persuasion probabilities, and analyze the theoretical property of the algorithm. We conduct an extensive evaluation with real-world social network data and show that our method substantially outperforms prevalent methods from representative previous research and salient industry practices.
引用
收藏
页码:63 / +
页数:34
相关论文
共 87 条
[1]   Social Interactions and the "Digital Divide": Explaining Variations in Internet Use [J].
Agarwal, Ritu ;
Animesh, Animesh ;
Prasad, Kislaya .
INFORMATION SYSTEMS RESEARCH, 2009, 20 (02) :277-294
[2]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[3]  
[Anonymous], P 12 INT C DIS SCI P
[4]  
[Anonymous], PLOS ONE
[5]  
[Anonymous], 1998, A structural theory of social influence
[6]  
[Anonymous], 1971, Journal of Mathematical Sociology, DOI 10.1080/0022250X.1971.9989788
[7]  
[Anonymous], 1999, Applied Mathematical Modeling: A Multidisciplinary Approach
[8]  
Graph-theoretic analysis of finite Markov chains
[9]  
[Anonymous], 2013, INFORM SYST RES, V24, P128, DOI DOI 10.1287/isre.1120.0461
[10]  
[Anonymous], P 4 KDD WORKSH SOC N