PPRank: Economically Selecting Initial Users for Influence Maximization in Social Networks

This paper focuses on seeking a new heuristic scheme for an influence maximization problem in social networks: how to economically select a subset of individuals (so-called seeds) to trigger a large cascade of further adoptions of a new behavior based on a contagion process. Most existing works on selection of seeds assumed that the constant number $k$ seeds could be selected, irrespective of the intrinsic property of each individual's different susceptibility of being influenced (e.g., it may be costly to persuade some seeds to adopt a new behavior). In this paper, a price-performance-ratio inspired heuristic scheme, PPRank, is proposed, which investigates how to economically select seeds within a given budget and meanwhile try to maximize the diffusion process. Our paper's contributions are threefold. First, we explicitly characterize each user with two distinct factors: the susceptibility of being influenced (SI) and influential power (IP) representing the ability to actively influence others and formulate users' SIs and IPs according to their social relations, and then, a convex price-demand curve-based model is utilized to properly convert each user's SI into persuasion cost (PC) representing the cost used to successfully make the individual adopt a new behavior. Furthermore, a novel cost-effective selection scheme is proposed, which adopts both the price performance ratio (PC-IP ratio) and user's IP as an integrated selection criterion and meanwhile explicitly takes into account the overlapping effect; finally, simulations using both artificially generated and real-trace network data illustrate that, under the same budgets, PPRank can achieve larger diffusion range than other heuristic and brute-force greedy schemes without taking users' persuasion costs into account.

[1]  N. Christakis,et al.  Social Network Sensors for Early Detection of Contagious Outbreaks , 2010, PloS one.

[2]  Rong Zheng,et al.  On Budgeted Influence Maximization in Social Networks , 2012, IEEE Journal on Selected Areas in Communications.

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

[4]  Kyomin Jung,et al.  IRIE: Scalable and Robust Influence Maximization in Social Networks , 2011, 2012 IEEE 12th International Conference on Data Mining.

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

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

[7]  Y. Narahari,et al.  A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks , 2011, IEEE Transactions on Automation Science and Engineering.

[8]  Naixue Xiong,et al.  On Studying the Impact of Uncertainty on Behavior Diffusion in Social Networks , 2015, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[9]  Naoki Masuda,et al.  Dynamics-based centrality for directed networks. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[11]  Jon M. Kleinberg,et al.  Cascading behavior in social and economic networks , 2013, EC '13.

[12]  Jianhua Ma,et al.  PRDiscount: A Heuristic Scheme of Initial Seeds Selection for Diffusion Maximization in Social Networks , 2014, ICIC.

[13]  Aravind Srinivasan,et al.  Your friends have more friends than you do: identifying influential mobile users through random walks , 2012, MobiHoc '12.

[14]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[15]  Zhilin Luo,et al.  A PageRank-Based Heuristic Algorithm for Influence Maximization in the Social Network , 2012 .

[16]  Wei Chen,et al.  Scalable influence maximization for prevalent viral marketing in large-scale social networks , 2010, KDD.

[17]  S. Brenner,et al.  The structure of the nervous system of the nematode Caenorhabditis elegans. , 1986, Philosophical transactions of the Royal Society of London. Series B, Biological sciences.

[18]  Wei Chen,et al.  Scalable influence maximization for independent cascade model in large-scale social networks , 2012, Data Mining and Knowledge Discovery.

[19]  Aravind Srinivasan,et al.  Your Friends Have More Friends Than You Do: Identifying Influential Mobile Users Through Random-Walk Sampling , 2014, IEEE/ACM Transactions on Networking.

[20]  H. Spencer The structure of the nervous system. , 1870 .

[21]  J. Kleinberg Algorithmic Game Theory: Cascading Behavior in Networks: Algorithmic and Economic Issues , 2007 .

[22]  Itay P. Fainmesser,et al.  The Value of Network Information , 2013 .

[23]  Christos Faloutsos,et al.  Automatic multimedia cross-modal correlation discovery , 2004, KDD.

[24]  Laks V. S. Lakshmanan,et al.  CELF++: optimizing the greedy algorithm for influence maximization in social networks , 2011, WWW.

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

[26]  Laks V. S. Lakshmanan,et al.  Information and Influence Propagation in Social Networks , 2013, Synthesis Lectures on Data Management.

[27]  Paul Jen-Hwa Hu,et al.  Predicting Adoption Probabilities in Social Networks , 2012, Inf. Syst. Res..

[28]  Mahmoud Fouz,et al.  Why rumors spread so quickly in social networks , 2012, Commun. ACM.

[29]  Gerhard Weikum,et al.  The Juxtaposed approximate PageRank method for robust PageRank approximation in a peer-to-peer web search network , 2008, The VLDB Journal.

[30]  Donald F. Towsley,et al.  Social Sensor Placement in Large Scale Networks: A Graph Sampling Perspective , 2013, ArXiv.

[31]  Sunju Park,et al.  Determining Content Power Users in a Blog Network: An Approach and Its Applications , 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[32]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

[33]  Laks V. S. Lakshmanan,et al.  Learning influence probabilities in social networks , 2010, WSDM '10.