Adversarial Graph Embeddings for Fair Influence Maximization over SocialNetworks

05/08/2020
by   Moein Khajehnejad, et al.
5

Influence maximization is a widely studied topic in network science, where the aim is to reach the maximum possible number of nodes, while only targeting a small initial set of individuals. It has critical applications in many fields, including viral marketing, information propagation, news dissemination, and vaccinations. However, the objective does not usually take into account whether the final set of influenced nodes is fair with respect to sensitive attributes, such as race or gender. Here we address fair influence maximization, aiming to reach minorities more equitably. We introduce Adversarial Graph Embeddings: we co-train an auto-encoder for graph embedding and a discriminator to discern sensitive attributes. This leads to embeddings which are similarly distributed across sensitive attributes. We then find a good initial set by clustering the embeddings. We believe we are the first to use embeddings for the task of fair influence maximization. While there are typically trade-offs between fairness and influence maximization objectives, our experiments on synthetic and real-world datasets show that our approach dramatically reduces disparity while remaining competitive with state-of-the-art influence maximization methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/08/2020

Adversarial Graph Embeddings for Fair Influence Maximization over Social Networks

Influence maximization is a widely studied topic in network science, whe...
research
05/16/2019

On the Fairness of Time-Critical Influence Maximization in Social Networks

Influence maximization has found applications in a wide range of real-wo...
research
04/10/2019

Attraction-Repulsion clustering with applications to fairness

In the framework of fair learning, we consider clustering methods that a...
research
06/02/2023

Influence Maximization with Fairness at Scale (Extended Version)

In this paper, we revisit the problem of influence maximization with fai...
research
01/20/2022

Identifying critical nodes in complex networks by graph representation learning

Because of its wide application, critical nodes identification has becom...
research
03/03/2019

Group-Fairness in Influence Maximization

Influence maximization is a widely used model for information disseminat...
research
06/12/2023

Scalable Fair Influence Maximization

Given a graph G, a community structure 𝒞, and a budget k, the fair influ...

Please sign up or login with your details

Forgot password? Click here to reset