IMPC: Influence maximization based on multi-neighbor potential in community networks

Abstract The study of influence maximization (IM) has attracted many scholars in recent years due to its import practical values. Given a social network, it aims at finding a subset of k individuals as seed nodes which can trigger the maximum influence cascade through the network under a predefined diffusion model. Kempe et al. first formulated influence maximization as a discrete optimization problem and proved its NP-hardness and submodularity, based on which they further proposed a greedy approach with guaranteed solution accuracy. Unfortunately, the greedy algorithm was also known for its extremely low time efficiency. To solve this problem more efficiently, many research works were proposed in recent years. However, these studies either make sacrifices in solution accuracy or require huge memory consumption. Besides, only a handful of research works can handle mega-scale networks with millions of nodes and edges. To solve this problem both efficiently and effectively, in this paper we propose IMPC: an influence maximization framework based on multi-neighbor potential in community networks. In our approach the influence diffusion process is divided into two phases: (i) multi-neighbor potential based seeds expansion; and (ii) intra-community influence propagation. Based on this framework we derive an objective function to evaluate the overall influence as a combination of the influence during the two phases. We theoretically prove that the objective function is submodular and design an efficient greedy algorithm to find the seed nodes. We evaluate the performance of our framework on eight real-world networks which scale up to millions of nodes and hundreds of millions of edges. Experimental results show that our approach can significantly outperform other state-of-the-art algorithms in terms of time and space efficiency with no compromise on solution accuracy.

[1]  Xuemin Lin,et al.  Bring Order into the Samples: A Novel Scalable Method for Influence Maximization (Extended Abstract) , 2017, 2017 IEEE 33rd International Conference on Data Engineering (ICDE).

[2]  Sang-Wook Kim,et al.  Influence maximisation in social networks: A target-oriented estimation , 2018, J. Inf. Sci..

[3]  Song Wang,et al.  OASNET: an optimal allocation approach to influence maximization in modular social networks , 2010, SAC '10.

[4]  Matthew Richardson,et al.  Trust Management for the Semantic Web , 2003, SEMWEB.

[5]  Jure Leskovec,et al.  The dynamics of viral marketing , 2005, EC '06.

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

[7]  Laks V. S. Lakshmanan,et al.  Revisiting the Stop-and-Stare Algorithms for Influence Maximization , 2017, Proc. VLDB Endow..

[8]  Hui Xiong,et al.  Influence Maximization over Large-Scale Social Networks: A Bounded Linear Approach , 2014, CIKM.

[9]  Weimin Li,et al.  An overlapping network community partition algorithm based on semi-supervised matrix factorization and random walk , 2018, Expert Syst. Appl..

[10]  Han Zhao,et al.  Identifying influential nodes in complex networks with community structure , 2013, Knowl. Based Syst..

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

[12]  Jun Ma,et al.  Identifying and ranking influential spreaders in complex networks with consideration of spreading probability , 2017 .

[13]  Yilong Yin,et al.  A Maximal Clique Based Multiobjective Evolutionary Algorithm for Overlapping Community Detection , 2017, IEEE Transactions on Evolutionary Computation.

[14]  Qingcai Chen,et al.  Overlapping community detection in weighted networks via a Bayesian approach , 2017 .

[15]  Xiaochun Cao,et al.  A Stochastic Model for Detecting Overlapping and Hierarchical Community Structure , 2015, PloS one.

[16]  Dong Xu,et al.  Influence Spreading Path and Its Application to the Time Constrained Social Influence Maximization Problem and Beyond , 2014, IEEE Transactions on Knowledge and Data Engineering.

[17]  Lidia A. Braunstein,et al.  Effects of time-delays in the dynamics of social contagions , 2018 .

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

[19]  Li Guo,et al.  On the Upper Bounds of Spread for Greedy Algorithms in Social Network Influence Maximization , 2015, IEEE Transactions on Knowledge and Data Engineering.

[20]  Xin Li,et al.  CoFIM: A community-based framework for influence maximization on large-scale networks , 2017, Knowl. Based Syst..

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

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

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

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

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

[26]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[27]  Yue Liu,et al.  Learning sequential features for cascade outbreak prediction , 2018, Knowledge and Information Systems.

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

[29]  Meng Cai,et al.  Social contagions on correlated multiplex networks , 2017, Physica A: Statistical Mechanics and its Applications.

[30]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[31]  Jianguo Liu,et al.  Identifying multiple influential spreaders in term of the distance-based coloring , 2016 .

[32]  Jinghua Zhu,et al.  A New Structure-Hole-Based Algorithm For Influence Maximization in Large Online Social Networks , 2017, IEEE Access.

[33]  Yitong Wang,et al.  A Potential-Based Node Selection Strategy for Influence Maximization in a Social Network , 2009, ADMA.

[34]  Yong Feng,et al.  A Linear Time Algorithm for Influence Maximization in Large-Scale Social Networks , 2017, ICONIP.

[35]  Cheng Wu,et al.  A Real-Time Detecting Algorithm for Tracking Community Structure of Dynamic Networks , 2014, ArXiv.

[36]  Vijay Mahajan,et al.  New Product Diffusion Models in Marketing: A Review and Directions for Research: , 1990 .

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

[38]  Wei Wang,et al.  Social contagions with heterogeneous credibility , 2018, Physica A: Statistical Mechanics and its Applications.

[39]  Maria J. Serna,et al.  Centrality measure in social networks based on linear threshold model , 2018, Knowl. Based Syst..

[40]  Xian-kun Zhang,et al.  Label propagation algorithm for community detection based on node importance and label influence , 2017 .

[41]  Sang-Wook Kim,et al.  Accurate Path-based Methods for Influence Maximization in Social Networks , 2016, WWW.

[42]  Shangbo Zhou,et al.  Effective Influence Maximization Based on the Combination of Multiple Selectors , 2017, WASA.

[43]  Peter H. Reingen,et al.  Social Ties and Word-of-Mouth Referral Behavior , 1987 .

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

[45]  Ming Tang,et al.  Identifying multiple influential spreaders based on generalized closeness centrality , 2018 .

[46]  Feng Xie,et al.  Epidemic spreading on complex networks with overlapping and non-overlapping community structure , 2015 .

[47]  Xuemin Lin,et al.  Efficient Distance-Aware Influence Maximization in Geo-Social Networks , 2017, IEEE Transactions on Knowledge and Data Engineering.

[48]  Qinbao Song,et al.  LinkLPA: A Link‐Based Label Propagation Algorithm for Overlapping Community Detection in Networks , 2017, Comput. Intell..

[49]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[50]  Jinha Kim,et al.  Scalable and parallelizable processing of influence maximization for large-scale social networks? , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

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

[52]  Cheng Wu,et al.  How Overlapping Community Structure Affects Epidemic Spreading in Complex Networks , 2014, 2014 IEEE 38th International Computer Software and Applications Conference Workshops.

[53]  Suh-Yin Lee,et al.  CIM: Community-Based Influence Maximization in Social Networks , 2014, TIST.

[54]  Kevin E. Bassler,et al.  Network community detection using modularity density measures , 2017, ArXiv.

[55]  Haifeng Zhang,et al.  Identifying multiple influential spreaders by a heuristic clustering algorithm , 2017 .

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

[57]  Jiangtao Cui,et al.  Conformity-aware influence maximization in online social networks , 2014, The VLDB Journal.

[58]  Kaiqi Zhang,et al.  Maximizing influence in a social network: Improved results using a genetic algorithm , 2017 .

[59]  Cheng Wu,et al.  Targeted revision: A learning-based approach for incremental community detection in dynamic networks , 2016 .

[60]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[61]  Laurent Massoulié,et al.  A spectral method for community detection in moderately sparse degree-corrected stochastic block models , 2015, Advances in Applied Probability.