Heuristic Algorithms for Influence Maximization in Partially Observable Social Networks

We consider the problem of selecting the most influential members within a social network, in order to disseminate a message as widely as possible. This problem, also referred to as seed selection for influence maximization, has been under intensive investigation since the emergence of social networks. Nonetheless, a large body of existing research is based on the assumption that the network is completely known, whereas little work considers partially observable networks. Yet, due to many issues including the extremely large size of current networks and privacy considerations, assuming full knowledge of the network is rather unrealistic. Despite this, an influencer often wishes to distribute its message far beyond the boundaries of the known network. In this paper, we propose a set of novel heuristic algorithms that specifically target nodes at this boundary, in order to maximize influence across the whole network. We show that these algorithmsoutperform the state of the art by up to 38% in networks with partial observability.

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

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

[3]  A. Barabasi,et al.  Network science , 2016, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[4]  Zheng Wen,et al.  Influence Maximization with Semi-Bandit Feedback , 2016, ArXiv.

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

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

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

[8]  Shaojie Tang,et al.  No Time to Observe: Adaptive Influence Maximization with Partial Feedback , 2016, IJCAI.

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

[10]  Jie Tang,et al.  Influence Maximization in Dynamic Social Networks , 2013, 2013 IEEE 13th International Conference on Data Mining.

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

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

[13]  Masahiro Kimura,et al.  Prediction of Information Diffusion Probabilities for Independent Cascade Model , 2008, KES.

[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]  Wei Chen,et al.  Scalable influence maximization for independent cascade model in large-scale social networks , 2012, Data Mining and Knowledge Discovery.

[16]  Laks V. S. Lakshmanan,et al.  Influence Maximization with Bandits , 2015, ArXiv.

[17]  Sainyam Galhotra,et al.  Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study , 2018 .

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

[19]  John T. Jost,et al.  What makes you think you're so popular? Self-evaluation maintenance and the subjective side of the "friendship paradox" , 2001 .

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

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

[22]  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).

[23]  Krishna P. Gummadi,et al.  Measuring User Influence in Twitter: The Million Follower Fallacy , 2010, ICWSM.

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