An adaptive discrete particle swarm optimization for influence maximization based on network community structure

As an important research field of social network analysis, influence maximization problem is targeted at selecting a small group of influential nodes such that the spread of influence triggered by ...

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

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

[3]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Song Wang,et al.  Maximizing influence spread in modular social networks by optimal resource allocation , 2011, Expert Syst. Appl..

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

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

[7]  Philip S. Yu,et al.  Understanding Community Effects on Information Diffusion , 2015, PAKDD.

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

[9]  S. Mahadevan,et al.  A new method of identifying influential nodes in complex networks based on TOPSIS , 2014 .

[10]  Steve Gregory,et al.  Finding Overlapping Communities Using Disjoint Community Detection Algorithms , 2009, CompleNet.

[11]  Hongming Mo,et al.  Evidential method to identify influential nodes in complex networks , 2015 .

[12]  Tian Bian,et al.  A new evidential methodology of identifying influential nodes in complex networks , 2017 .

[13]  A Díaz-Guilera,et al.  Self-similar community structure in a network of human interactions. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Maoguo Gong,et al.  Influence maximization in social networks based on discrete particle swarm optimization , 2016, Inf. Sci..

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

[16]  Rubén González Crespo,et al.  MOVPSO: Vortex Multi-Objective Particle Swarm Optimization , 2017, Appl. Soft Comput..

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

[18]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[19]  Licheng Jiao,et al.  A coevolutionary technique based on multi-swarm particle swarm optimization for dynamic multi-objective optimization , 2017, Eur. J. Oper. Res..

[20]  Shangbo Zhou,et al.  IMPC: Influence maximization based on multi-neighbor potential in community networks , 2018, Physica A: Statistical Mechanics and its Applications.

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

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

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

[24]  Mark E. J. Newman.  A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

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

[26]  Laizhong Cui,et al.  DDSE: A novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks , 2018, J. Netw. Comput. Appl..

[27]  D. Sornette,et al.  The US Stock Market Leads the Federal Funds Rate and Treasury Bond Yields , 2011, PloS one.

[28]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  Fan Yang,et al.  Identification of top-k influential nodes based on enhanced discrete particle swarm optimization for influence maximization , 2019, Physica A: Statistical Mechanics and its Applications.

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

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

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

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

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

[35]  Hai Jin,et al.  Scalable influence maximization under independent cascade model , 2017, J. Netw. Comput. Appl..

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

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

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

[39]  Paul R. Cohen,et al.  Maximizing Influence Propagation in Networks with Community Structure , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[41]  Ping Wang,et al.  Maximizing the spread of influence via the collective intelligence of discrete bat algorithm , 2018, Knowl. Based Syst..