Fair Graph Neural Network with Supervised Contrastive Regularization

Mahdi Tavassoli Kejani, Fadi Dornaika, Jean-Michel Loubes
4/9/2024
cs.LGcs.AI

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

In recent years, Graph Neural Networks (GNNs) have made significant advancements, particularly in tasks such as node classification, link prediction, and graph representation. However, challenges arise from biases that can be hidden not only in the node attributes but also in the connections between entities. Therefore, ensuring fairness in graph neural network learning has become a critical problem. To address this issue, we propose a novel model for training fairness-aware GNN, which enhances the Counterfactual Augmented Fair Graph Neural Network Framework (CAF). Our approach integrates Supervised Contrastive Loss and Environmental Loss to enhance both accuracy and fairness. Experimental validation on three real datasets demonstrates the superiority of our proposed model over CAF and several other existing graph-based learning methods.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kejani2024fair,
  title  = {Fair Graph Neural Network with Supervised Contrastive Regularization},
  author = {Mahdi Tavassoli Kejani and Fadi Dornaika and Jean-Michel Loubes},
  year   = {2024},
  eprint = {2404.06090},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.06090v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2404.06090.svg)](https://codeofpaper.com/paper/2404.06090)

Discussion