Predicting Adoption Probabilities in Social Networks

被引:38
作者
Fang, Xiao [1 ]
Hu, Paul Jen-Hwa [1 ]
Li, Zhepeng [1 ]
Tsai, Weiyu [1 ]
机构
[1] Univ Utah, David Eccles Sch Business, Salt Lake City, UT 84112 USA
关键词
adoption probability; social network; Bayesian learning; social influence; structural equivalence; entity similarity; confounding factor; CONTAGION; MODELS; DIFFUSION; INNOVATION; PROXIMITY;
D O I
10.1287/isre.1120.0461
中图分类号
G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];
学科分类号
1205 ; 120501 ;
摘要
In a social network, adoption probability refers to the probability that a social entity will adopt a product, service, or opinion in the foreseeable future. Such probabilities are central to fundamental issues in social network analysis, including the influence maximization problem. In practice, adoption probabilities have significant implications for applications ranging from social network-based target marketing to political campaigns, yet predicting adoption probabilities has not received sufficient research attention. Building on relevant social network theories, we identify and operationalize key factors that affect adoption decisions: social influence, structural equivalence, entity similarity, and confounding factors. We then develop the locally weighted expectation-maximization method for Naive Bayesian learning to predict adoption probabilities on the basis of these factors. The principal challenge addressed in this study is how to predict adoption probabilities in the presence of confounding factors that are generally unobserved. Using data from two large-scale social networks, we demonstrate the effectiveness of the proposed method. The empirical results also suggest that cascade methods primarily using social influence to predict adoption probabilities offer limited predictive power and that confounding factors are critical to adoption probability predictions.
引用
收藏
页码:128 / 145
页数:18
相关论文
共 84 条
  • [1] Altshuler Yaniv, 2012, Social Computing, Behavioral-Cultural Modeling and Prediction. Proceedings of the 5th International Conference, SBP 2012, P97, DOI 10.1007/978-3-642-29047-3_12
  • [2] [Anonymous], 1998, A structural theory of social influence
  • [3] [Anonymous], 2003, PRACTICAL GUIDE SUPP, DOI [DOI 10.1177/02632760022050997, 10 . 1177 / 02632760022050997]
  • [4] [Anonymous], 1971, Journal of Mathematical Sociology, DOI 10.1080/0022250X.1971.9989788
  • [5] [Anonymous], 1983, Sociological theory, DOI [10.2307/202050, DOI 10.2307/202050]
  • [6] [Anonymous], 2010, P 3 ACM INT C WEB SE, DOI DOI 10.1145/1718487.1718520
  • [7] [Anonymous], 2006, Pattern recognition and machine learning
  • [8] [Anonymous], 2001, P 7 ACM SIGKDD INT C, DOI [DOI 10.1145/502512.502525, 10.1145/502512.502525]
  • [9] Aral S., 2011, Engineering Social Contagions: Optimal Network Seeding and Incentive Strategies
  • [10] Identifying Influential and Susceptible Members of Social Networks
    Aral, Sinan
    Walker, Dylan
    [J]. SCIENCE, 2012, 337 (6092) : 337 - 341