Influence maximisation beyond organisational boundaries

We consider the problem of choosing influential members within a social network, in order to disseminate a message as widely as possible. While this so-called problem of influence maximisation has been widely studied, little work considers partially-observable networks, where only part of a network is visible to the decision maker. Yet, this is critical in many applications, where an organisation needs to distribute its message far beyond its boundaries and beyond its usual sphere of influence. In this paper, we show that existing algorithms are not sufficient to handle such scenarios. To address this, we propose a set of novel adaptive algorithms that perform well in partially observable settings, achieving an up to 18% improvement on the non-adaptive state of the art.

[1]  Sainyam Galhotra,et al.  Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study , 2017, SIGMOD Conference.

[2]  François Bry,et al.  Human computation , 2018, it Inf. Technol..

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

[4]  Raphaël Clifford,et al.  ACM-SIAM Symposium on Discrete Algorithms , 2015, SODA 2015.

[5]  Elchanan Mossel,et al.  Submodularity of Influence in Social Networks: From Local to Global , 2010, SIAM J. Comput..

[6]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[7]  Xiaokui Xiao,et al.  Influence maximization: near-optimal time complexity meets practical efficiency , 2014, SIGMOD Conference.

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

[9]  Nicole Immorlica,et al.  Uncharted but not Uninfluenced: Influence Maximization with an Uncertain Network , 2017, AAMAS.

[10]  Wei Chen,et al.  Robust Influence Maximization , 2016, KDD.

[11]  Jacob Goldenberg,et al.  Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth , 2001 .

[12]  Xiaokui Xiao,et al.  Influence Maximization in Near-Linear Time: A Martingale Approach , 2015, SIGMOD Conference.

[13]  Hiroyuki Ohsaki,et al.  Influence maximization problem for unknown social networks , 2015, 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[14]  Yifei Yuan,et al.  Scalable Influence Maximization in Social Networks under the Linear Threshold Model , 2010, 2010 IEEE International Conference on Data Mining.

[15]  Nicholas R. Jennings,et al.  Coordinating Measurements for Air Pollution Monitoring in Participatory Sensing Settings , 2015, AAMAS.

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

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

[18]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[19]  Matthew Richardson,et al.  Mining knowledge-sharing sites for viral marketing , 2002, KDD.

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