Threshold-Bounded Influence Dominating Sets for Recommendations in Social Networks

The process of decision making in humans involves a combination of the genuine information held by the individual, and the external influence from their social network connections. This helps individuals to make decisions or adopt behaviors, opinions or products. In this work, we seek to investigate under which conditions and with what cost we can form neighborhoods of influence within a social network, in order to assist individuals with little or no prior genuine information through a two-phase recommendation process. Most of the existing approaches regard the problem of identifying influentials as a long-term, network diffusion process, where information cascading occurs in several rounds and has fixed number of influentials. In our approach we consider only one round of influence, which finds applications in settings where timely influence is vital. We tackle the problem by proposing a two-phase framework that aims at identifying influentials in the first phase and form influential neighborhoods to generate recommendations to users with no prior knowledge in the second phase. The difference of the proposed framework with most social recommender systems is that we need to generate recommendations including more than one item and in the absence of explicit ratings, solely relying on the social network's graph.

[1]  Michalis Vazirgiannis,et al.  Spread it Good, Spread it Fast: Identification of Influential Nodes in Social Networks , 2015, WWW.

[2]  M. McPherson,et al.  Birds of a Feather: Homophily in Social Networks , 2001 .

[3]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[4]  Jon M. Kleinberg,et al.  The structure of information pathways in a social communication network , 2008, KDD.

[5]  Yan Shi,et al.  On positive influence dominating sets in social networks , 2011, Theor. Comput. Sci..

[6]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[7]  Jure Leskovec,et al.  Defining and evaluating network communities based on ground-truth , 2012, Knowledge and Information Systems.

[8]  Krishna P. Gummadi,et al.  Measurement and analysis of online social networks , 2007, IMC '07.

[9]  Huan Liu,et al.  Exploiting homophily effect for trust prediction , 2013, WSDM.

[10]  Klaus-Tycho Förster,et al.  Approximating Fault-Tolerant Domination in General Graphs , 2013, ANALCO.

[11]  Martin Ester,et al.  A matrix factorization technique with trust propagation for recommendation in social networks , 2010, RecSys '10.

[12]  David Carmel,et al.  Social recommender systems , 2011, Recommender Systems Handbook.

[13]  R. Huckfeldt,et al.  Networks in Context: The Social Flow of Political Information , 1987, American Political Science Review.

[14]  Qi He,et al.  TwitterRank: finding topic-sensitive influential twitterers , 2010, WSDM '10.

[15]  N. Christakis,et al.  Social network targeting to maximise population behaviour change: a cluster randomised controlled trial , 2015, The Lancet.

[16]  Andreas Krause,et al.  Cost-effective outbreak detection in networks , 2007, KDD '07.

[17]  Reynold Cheng,et al.  Online Influence Maximization , 2015, KDD.

[18]  Chris Arney,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Easley, D. and Kleinberg, J.; 2010) [Book Review] , 2013, IEEE Technology and Society Magazine.

[19]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[20]  Huan Liu,et al.  Social recommendation: a review , 2013, Social Network Analysis and Mining.

[21]  Christian Borgs,et al.  Maximizing Social Influence in Nearly Optimal Time , 2012, SODA.

[22]  Cosma Rohilla Shalizi,et al.  Homophily and Contagion Are Generically Confounded in Observational Social Network Studies , 2010, Sociological methods & research.

[23]  Jinhui Tang,et al.  Online Topic-Aware Influence Maximization , 2015, Proc. VLDB Endow..

[24]  David Peleg,et al.  Local majorities, coalitions and monopolies in graphs: a review , 2002, Theor. Comput. Sci..

[25]  Elizabeth Dubois,et al.  The Multiple Facets of Influence , 2014 .

[26]  Michael R. Lyu,et al.  Learning to recommend with social trust ensemble , 2009, SIGIR.

[27]  Weili Wu,et al.  Positive influence dominating sets in power-law graphs , 2011, Social Network Analysis and Mining.

[28]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[29]  Stephen T. Hedetniemi,et al.  Bibliography on domination in graphs and some basic definitions of domination parameters , 1991, Discret. Math..

[30]  Chao Liu,et al.  Recommender systems with social regularization , 2011, WSDM '11.

[31]  Wei Chen,et al.  Efficient influence maximization in social networks , 2009, KDD.

[32]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[33]  Huan Liu,et al.  mTrust: discerning multi-faceted trust in a connected world , 2012, WSDM '12.

[34]  Ning Chen,et al.  On the approximability of influence in social networks , 2008, SODA '08.