Discrete particle swarm optimization based influence maximization in complex networks

The aim of influence maximization problem is to mine a small set of influential individuals in a complex network which could reach the maximum influence spread. In this paper, an efficient fitness function based on local influence is designed to estimate the influence spread. Then, we propose a discrete particle swarm optimization based algorithm to find the final set with the maximum value of the fitness function. In the proposed algorithm, discrete position and velocity are redefined and problem-specific update rules are designed. In order to accelerate the convergence, we introduce a degree-based population initialization method and a mutation learning based local search strategy. Experimental results compared with four comparison algorithms show that our proposed algorithm is able to efficiently find good-quality solutions.

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

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

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

[4]  Masahiro Kimura,et al.  Extracting influential nodes on a social network for information diffusion , 2009, Data Mining and Knowledge Discovery.

[5]  Freimut Bodendorf,et al.  Warning system for online market research - Identifying critical situations in online opinion formation , 2011, Knowl. Based Syst..

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

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

[8]  Michael R. Lyu,et al.  Mining social networks using heat diffusion processes for marketing candidates selection , 2008, CIKM '08.

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

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

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

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

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

[14]  Barry Smyth,et al.  A Classification-based Review Recommender , 2009, SGAI Conf..

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

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

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

[18]  Éva Tardos,et al.  Influential Nodes in a Diffusion Model for Social Networks , 2005, ICALP.

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

[20]  Barry Smyth,et al.  A classification-based review recommender , 2010, Knowl. Based Syst..

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

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