Location-Based Seeds Selection for Influence Blocking Maximization in Social Networks

Influence blocking maximization (IBM) is a key problem for viral marketing in competitive social networks. Although the IBM problem has been extensively studied, existing works neglect the fact that the location information can play an important role in influence propagation. In this paper, we study the location-based seeds selection for IBM problem, which aims to find a positive seed set in a given query region to block the negative influence propagation in a given block region as much as possible. In order to overcome the low efficiency of the simulation-based greedy algorithm, we propose a heuristic algorithm IS-LSS and its improved version IS-LSS+, both of which are based on the maximum influence arborescence structure and Quadtree index, while IS-LSS+ further improves the efficiency of IS-LSS by using an upper bound method and Quadtree cell lists. The experimental results on real-world datasets demonstrate that our proposed algorithms are able to achieve matching blocking effect to the greedy algorithm as the increase in the number of positive seeds and often better than other heuristic algorithms, whereas they are four orders of magnitude faster than the greedy algorithm.

[1]  Mohsen Guizani,et al.  An effective key management scheme for heterogeneous sensor networks , 2007, Ad Hoc Networks.

[2]  Wei Chen,et al.  IMRank: influence maximization via finding self-consistent ranking , 2014, SIGIR.

[3]  Xuemin Lin,et al.  Distance-aware influence maximization in geo-social network , 2016, 2016 IEEE 32nd International Conference on Data Engineering (ICDE).

[4]  Ken-ichi Kawarabayashi,et al.  Coarsening Massive Influence Networks for Scalable Diffusion Analysis , 2017, SIGMOD Conference.

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

[6]  Wen-Chih Peng,et al.  Modeling User Mobility for Location Promotion in Location-based Social Networks , 2015, KDD.

[7]  Allan Borodin,et al.  Threshold Models for Competitive Influence in Social Networks , 2010, WINE.

[8]  Li Pan,et al.  Scalable influence blocking maximization in social networks under competitive independent cascade models , 2017, Comput. Networks.

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

[10]  Kian-Lee Tan,et al.  Efficient location-aware influence maximization , 2014, SIGMOD Conference.

[11]  Hung T. Nguyen,et al.  Importance Sketching of Influence Dynamics in Billion-Scale Networks , 2017, 2017 IEEE International Conference on Data Mining (ICDM).

[12]  Shourya Roy,et al.  Holistic Influence Maximization: Combining Scalability and Efficiency with Opinion-Aware Models , 2016, SIGMOD Conference.

[13]  My T. Thai,et al.  A Billion-Scale Approximation Algorithm for Maximizing Benefit in Viral Marketing , 2017, IEEE/ACM Transactions on Networking.

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

[15]  Shaojie Tang,et al.  Adaptive Influence Maximization in Dynamic Social Networks , 2015, IEEE/ACM Transactions on Networking.

[16]  Shuai Xu,et al.  Location-Based Influence Maximization in Social Networks , 2015, CIKM.

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

[18]  Shishir Bharathi,et al.  Competitive Influence Maximization in Social Networks , 2007, WINE.

[19]  Divyakant Agrawal,et al.  Limiting the spread of misinformation in social networks , 2011, WWW.

[20]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[21]  Laks V. S. Lakshmanan,et al.  SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model , 2011, 2011 IEEE 11th International Conference on Data Mining.

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

[23]  My T. Thai,et al.  Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks , 2016, SIGMOD Conference.

[24]  Bin Yang,et al.  A community-based algorithm for influence blocking maximization in social networks , 2017, Cluster Computing.

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

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

[27]  Mong-Li Lee,et al.  Temporal Influence Blocking: Minimizing the Effect of Misinformation in Social Networks , 2017, 2017 IEEE 33rd International Conference on Data Engineering (ICDE).

[28]  Xiang Cheng,et al.  Location‐aware targeted influence maximization in social networks , 2018, J. Assoc. Inf. Sci. Technol..

[29]  Stefan M. Wild,et al.  Maximizing influence in a competitive social network: a follower's perspective , 2007, ICEC.

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

[31]  Ken-ichi Kawarabayashi,et al.  NoSingles: a space-efficient algorithm for influence maximization , 2018, SSDBM.

[32]  Xiang Cheng,et al.  Community-based seeds selection algorithm for location aware influence maximization , 2018, Neurocomputing.

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

[34]  Xiaojiang Du,et al.  Internet Protocol Television (IPTV): The Killer Application for the Next-Generation Internet , 2007, IEEE Communications Magazine.

[35]  André Luís Vignatti,et al.  A preselection algorithm for the influence maximization problem in power law graphs , 2018, SAC.

[36]  Xiaojiang Du,et al.  Location-Aware Influence Blocking Maximization in Social Networks , 2018, IEEE Access.

[37]  Aylin Yener,et al.  Maximizing recommender's influence in a social network: An information theoretic perspective , 2015, 2015 IEEE Information Theory Workshop - Fall (ITW).

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

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

[40]  Wei Chen,et al.  Influence Blocking Maximization in Social Networks under the Competitive Linear Threshold Model , 2011, SDM.

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

[42]  Rajasekhar Mungara,et al.  A Routing-Driven Elliptic Curve Cryptography based Key Management Scheme for Heterogeneous Sensor Networks , 2014 .