Multi-objective Evolutionary Algorithms for Influence Maximization in Social Networks

@inproceedings{Bucur2017MultiobjectiveEA,
  title={Multi-objective Evolutionary Algorithms for Influence Maximization in Social Networks},
  author={Doina Bucur and Giovanni Iacca and Andrea Marcelli and Giovanni Squillero and Alberto Paolo Tonda},
  booktitle={EvoApplications},
  year={2017}
}
As the pervasiveness of social networks increases, new NP-hard related problems become interesting for the optimization community. The objective of influence maximization is to contact the largest possible number of nodes in a network, starting from a small set of seed nodes, and assuming a model for information propagation. This problem is of utmost practical importance for applications ranging from social studies to marketing. The influence maximization problem is typically formulated… 
Improving Multi-objective Evolutionary Influence Maximization in Social Networks
TLDR
The proposed approach is tested on three publicly available real-world networks, where it is shown that the evolutionary algorithm is able to improve upon the solutions found by the heuristics, while also converging faster than an evolutionary algorithm started from scratch.
Evaluating surrogate models for multi-objective influence maximization in social networks
TLDR
Evaluating a surrogate-assisted Multi-Objective Evolutionary Algorithm that uses an approximate model of influence propagation (instead of Monte Carlo simulations) to find the minimum-sized set of most influential nodes.
A quick GRASP-based method for influence maximization in social networks
TLDR
A metaheuristic algorithm based on the Greedy Randomized Adaptive Search Procedure (GRASP) framework is considered to design a quick solution procedure for the SNIMP, whose goal is to find the most influential users in a social network, simulating an influence diffusion model.
Graph-aware evolutionary algorithms for influence maximization
TLDR
This paper uses approximate fitness functions to speed up the Evolutionary Algorithms and includes into the EA various graph-aware mechanisms, such as smart initialization, custom mutations and node filtering, to facilitate the EA convergence.
PRNSGA-II: A Novel Approach for Influence Maximization and Cost Minimization Based on NSGA-II
TLDR
This paper proposes a novel framework called PRNSGA-II, a classical and effective multi-objective framework to solve IM-CM, and adds PageRank to its first objective function to improve the quality of seed nodes and calculates the cost of nodes.
Large-scale multi-objective influence maximisation with network downscaling
TLDR
This work proposes an original method, based on network downscaling, that allows a multi-objective evolutionary algorithm (MOEA) to solve the IM problem on a reduced scale network, while preserving the relevant properties of the original network.
Evolutionary Computation in Social Propagation over Complex Networks: A Survey
TLDR
This paper contributes to recognizing the problems in application-oriented EC design and paves the way for the development of evolving propagation dynamics.
...
...

References

SHOWING 1-10 OF 24 REFERENCES
Scalable influence maximization for independent cascade model in large-scale social networks
TLDR
This article designs a new heuristic algorithm that is easily scalable to millions of nodes and edges and significantly outperforms all other scalable heuristics to as much as 100–260% increase in influence spread.
Influence Maximization in Social Networks with Genetic Algorithms
TLDR
This work tackles the NP-hard problem of influence maximization on social networks by means of a Genetic Algorithm and shows that, by using simple genetic operators, it is possible to find in feasible runtime solutions of high-influence that are comparable, and occasionally better, than the solutions found by a number of known heuristics.
Simulated Annealing Based Influence Maximization in Social Networks
TLDR
This paper proposes a totally different approach based on Simulated Annealing for the influence maximization problem, which is the first SA based algorithm for the problem and proposes two heuristic methods to accelerate the convergence process of SA and a new method of computing influence to speed up the proposed algorithm.
Maximizing the Spread of Influence through a Social Network
TLDR
An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.
Multiobjective evolutionary algorithms for dynamic social network clustering
TLDR
This paper reflects these characteristics of social networks based on real-world data, and proposes a suitable dynamic multiobjective evolutionary algorithm for graph clustering in dynamic environments under multiple objectives.
A Multiobjective Evolutionary Algorithm Based on Similarity for Community Detection From Signed Social Networks
TLDR
This work extends the original similarity to the signed similarity based on the social balance theory and proposes a multiobjective evolutionary algorithm, called MEAs-SN, which can detect overlapping communities directly and switch between different representations during the evolutionary process.
Community Detection from Signed Social Networks Using a Multi-objective Evolutionary Algorithm
TLDR
The experimental results show that the proposed method for detecting communities from signed social networks with both positive and negative weights obtains a good performance on both real world and synthetic data, and outperforms FEC clearly.
A Multiobjective Genetic Algorithm to Find Communities in Complex Networks
  • C. Pizzuti
  • Computer Science
    IEEE Transactions on Evolutionary Computation
  • 2012
TLDR
A multiobjective genetic algorithm to uncover community structure in complex network is proposed that successfully detects the network structure and it is competitive with state-of-the-art approaches.
Bayesian Network Structure Learning from Limited Datasets through Graph Evolution
TLDR
An evolutionary approach to the Bayesian structure learning problem, specifically tailored for learning sets of limited size, is proposed, able to outperform a state-of-the-art dependency-analysis algorithm, providing better models for small datasets.
...
...