PRNSGA-II: A Novel Approach for Influence Maximization and Cost Minimization Based on NSGA-II

Influence maximization aims to extract a k-size seed node set to get a maximum influence spread under a specific propagation model which is a popular research topic in viral marketing these years. Companies want to select influential people to help them increase the sales of productions. With the limited budget, companies are unable to afford the huge cost of finding influential people. Thus, how to solve the multi-objective problem i.e. influence maximization problem and cost minimization problem (IM-CM) attracts more researchers attentions. In this paper, we propose a novel framework called PRNSGA-II to solve IM-CM. As an important index in complex networks, PageRank describes the importance of nodes. So we add PageRank to our first objective function to improve the quality of seed nodes. Then to calculate the cost of nodes, we use the degree centrality as our second objective function. Finally, we adopt NSGA-II which is a classical and effective multi-objective framework to solve IM-CM. We use three public datasets to verify our algorithm. The results of experiments demonstrate the effectiveness of our algorithm.

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

[2]  Yang Dong,et al.  Research on Evolutionary Multi-Objective Optimization Algorithms , 2009 .

[3]  Peter J. Fleming,et al.  Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

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

[5]  Doina Bucur,et al.  Multi-objective Evolutionary Algorithms for Influence Maximization in Social Networks , 2017, EvoApplications.

[6]  Xi Chen,et al.  A Novel Approach for Influence Maximization Based on Clonal Selection Theory in Social Networks , 2018, 2018 IEEE International Conference on Data Mining Workshops (ICDMW).

[7]  Kuldeep Singh,et al.  C2IM: Community based context-aware influence maximization in social networks , 2019, Physica A: Statistical Mechanics and its Applications.

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

[9]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

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

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

[12]  R. K. Ursem Multi-objective Optimization using Evolutionary Algorithms , 2009 .

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

[14]  Jing Liu,et al.  Influence Maximization-Cost Minimization in Social Networks Based on a Multiobjective Discrete Particle Swarm Optimization Algorithm , 2018, IEEE Access.

[15]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

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

[17]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

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

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

[20]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

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

[22]  Doina Bucur,et al.  Improving Multi-objective Evolutionary Influence Maximization in Social Networks , 2018, EvoApplications.