Promoting Fairness in Link Prediction with Graph Enhancement
<|reference_start|>Promoting Fairness in Link Prediction with Graph Enhancement: Link prediction is a crucial task in network analysis, but it has been shown to be prone to biased predictions, particularly when links are unfairly predicted between nodes from different sensitive groups. In this paper, we study the fair link prediction problem, which aims to ensure that the predicted link probability is independent of the sensitive attributes of the connected nodes. Existing methods typically incorporate debiasing techniques within graph embeddings to mitigate this issue. However, training on large real-world graphs is already challenging, and adding fairness constraints can further complicate the process. To overcome this challenge, we propose FairLink, a method that learns a fairness-enhanced graph to bypass the need for debiasing during the link predictor's training. FairLink maintains link prediction accuracy by ensuring that the enhanced graph follows a training trajectory similar to that of the original input graph. Meanwhile, it enhances fairness by minimizing the absolute difference in link probabilities between node pairs within the same sensitive group and those between node pairs from different sensitive groups. Our extensive experiments on multiple large-scale graphs demonstrate that FairLink not only promotes fairness but also often achieves link prediction accuracy comparable to baseline methods. Most importantly, the enhanced graph exhibits strong generalizability across different GNN architectures.<|reference_end|>
@article{liu2024promoting,
    title={Promoting Fairness in Link Prediction with Graph Enhancement},
    author={Yezi Liu, Hanning Chen, Mohsen Imani},
    journal={arXiv preprint arXiv:2409.08658},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.08658},
    primaryClass={cs.LG}
}