Influence maximization in social networks based on discrete particle swarm optimization

Influence maximization in social networks aims to find a small group of individuals, which have maximal influence cascades. In this study, an optimization model based on a local influence criterion is established for the influence maximization problem. The local influence criterion can provide a reliable estimation for the influence propagations in independent and weighted cascade models. A discrete particle swarm optimization algorithm is then proposed to optimize the local influence criterion. The representations and update rules for the particles are redefined in the proposed algorithm. Moreover, a degree based heuristic initialization strategy and a network-specific local search strategy are introduced to speed up the convergence. Experimental results on four real-world social networks demonstrate the effectiveness and efficiency of the proposed algorithm for influence maximization.

[1]  Xin Wang,et al.  Friend recommendation with content spread enhancement in social networks , 2015, Inf. Sci..

[2]  He Jiang,et al.  New Insights Into Diversification of Hyper-Heuristics , 2014, IEEE Transactions on Cybernetics.

[3]  Jing J. Liang,et al.  Niching particle swarm optimization with local search for multi-modal optimization , 2012, Inf. Sci..

[4]  Filippo Menczer,et al.  Virality Prediction and Community Structure in Social Networks , 2013, Scientific Reports.

[5]  M. Friedman.  The Use of Ranks to Avoid the Assumption of Normality Implicit in the Analysis of Variance , 1937 .

[6]  Jong-Ryul Lee,et al.  A Query Approach for Influence Maximization on Specific Users in Social Networks , 2015, IEEE Transactions on Knowledge and Data Engineering.

[7]  Mark S. Granovetter.  Threshold Models of Collective Behavior , 1978, American Journal of Sociology.

[8]  Maoguo Gong,et al.  Enhancing robustness of coupled networks under targeted recoveries , 2015, Scientific Reports.

[9]  Maoguo Gong,et al.  Discrete particle swarm optimization for high-order graph matching , 2016, Inf. Sci..

[10]  Lei Xie,et al.  Minimizing the expected complete influence time of a social network , 2010, Inf. Sci..

[11]  Raymond Chiong,et al.  Forecasting interval time series using a fully complex-valued RBF neural network with DPSO and PSO algorithms , 2015, Inf. Sci..

[12]  Gao Cong,et al.  Simulated Annealing Based Influence Maximization in Social Networks , 2011, AAAI.

[13]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

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

[15]  Maoguo Gong,et al.  Discrete particle swarm optimization for identifying community structures in signed social networks , 2014, Neural Networks.

[16]  Cameron Marlow,et al.  A 61-million-person experiment in social influence and political mobilization , 2012, Nature.

[17]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[18]  S. Holm.  A Simple Sequentially Rejective Multiple Test Procedure , 1979 .

[19]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[20]  Sergey Brin,et al.  Reprint of: The anatomy of a large-scale hypertextual web search engine , 2012, Comput. Networks.

[21]  David Kempe,et al.  Stability of influence maximization , 2014, KDD.

[22]  Maoguo Gong,et al.  Greedy discrete particle swarm optimization for large-scale social network clustering , 2015, Inf. Sci..

[23]  Weili Wu,et al.  Influence Diffusion in Social Networks , 2014 .

[24]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

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

[26]  Jun Zhang,et al.  Competitive and cooperative particle swarm optimization with information sharing mechanism for global optimization problems , 2015, Inf. Sci..

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

[28]  Yicheng Zhang,et al.  Identifying influential nodes in complex networks , 2012 .

[29]  Jacob Goldenberg,et al.  Using Complex Systems Analysis to Advance Marketing Theory Development , 2001 .

[30]  Hernán A. Makse,et al.  Influence maximization in complex networks through optimal percolation , 2015, Nature.

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

[32]  Xiaodong Li,et al.  Swarm Intelligence in Optimization , 2008, Swarm Intelligence.

[33]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[34]  Jukka-Pekka Onnela,et al.  Spontaneous emergence of social influence in online systems , 2009, Proceedings of the National Academy of Sciences.

[35]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[36]  Francisco Herrera,et al.  A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special Session on Real Parameter Optimization , 2009, J. Heuristics.

[37]  Ciro Cattuto,et al.  What's in a crowd? Analysis of face-to-face behavioral networks , 2010, Journal of theoretical biology.

[38]  Russell C. Eberhart,et al.  Guest Editorial Special Issue on Particle Swarm Optimization , 2004, IEEE Trans. Evol. Comput..

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

[40]  Ali Moeini,et al.  A fast algorithm for finding most influential people based on the linear threshold model , 2015, Expert Syst. Appl..

[41]  Yu Wang,et al.  Influence Maximization on Large-Scale Mobile Social Network: A Divide-and-Conquer Method , 2015, IEEE Transactions on Parallel and Distributed Systems.

[42]  Francisco Herrera,et al.  A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms , 2011, Swarm Evol. Comput..

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

[44]  Christian Blum,et al.  Swarm Intelligence: Introduction and Applications , 2008, Swarm Intelligence.

[45]  Harry Eugene Stanley,et al.  Catastrophic cascade of failures in interdependent networks , 2009, Nature.

[46]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[47]  R. Iman,et al.  Approximations of the critical region of the fbietkan statistic , 1980 .

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

[49]  Leslie A. DeChurch,et al.  Integrating social networks and human social motives to achieve social influence at scale , 2014, Proceedings of the National Academy of Sciences.

[50]  Yao Zhang,et al.  Estimate on Expectation for Influence Maximization in Social Networks , 2010, PAKDD.

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

[52]  Jie Zhang,et al.  A Budget Optimization Framework for Search Advertisements Across Markets , 2012, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[53]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[54]  Bin Wu,et al.  Maximizing the spread of influence ranking in social networks , 2014, Inf. Sci..

[55]  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.

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

[57]  Masahiro Kimura,et al.  Super mediator - A new centrality measure of node importance for information diffusion over social network , 2016, Inf. Sci..

[58]  Riccardo Zecchina,et al.  Containing epidemic outbreaks by message-passing techniques , 2013, ArXiv.

[59]  Yu Wang,et al.  Community-based greedy algorithm for mining top-K influential nodes in mobile social networks , 2010, KDD.

[60]  I. N. A. C. I. J. H. Fowler.  Book Review: Connected: The surprising power of our social networks and how they shape our lives. , 2009 .

[61]  Ricardo Llano-González.  Fowler, J. & Christakis, N. (2009). Connected: the surprising power of our social networks and how they shape our lives. New York: Little, Brown and Company. , 2012 .

[62]  Zhiming Zheng,et al.  Searching for superspreaders of information in real-world social media , 2014, Scientific Reports.

[63]  Yiwen Sun,et al.  Three-dimensional Gabor feature extraction for hyperspectral imagery classification using a memetic framework , 2015, Inf. Sci..

[64]  Sankar K. Pal,et al.  Deprecation based greedy strategy for target set selection in large scale social networks , 2015, Inf. Sci..

[65]  He Jiang,et al.  Solving the Large Scale Next Release Problem with a Backbone-Based Multilevel Algorithm , 2012, IEEE Transactions on Software Engineering.

[66]  Zhen Ji,et al.  A multi-objective memetic algorithm based on locality-sensitive hashing for one-to-many-to-one dynamic pickup-and-delivery problem , 2016, Inf. Sci..