Addressing Shortcomings in Fair Graph Learning Datasets: Towards a New Benchmark
Abstract: Fair graph learning plays a pivotal role in numerous practical applications. Recently, many fair graph learning methods have been proposed; however, their evaluation often relies on poorly constructed semi-synthetic datasets or substandard real-world datasets. In such cases, even a basic Multilayer Perceptron (MLP) can outperform Graph Neural Networks (GNNs) in both utility and fairness. In this work, we illustrate that many datasets fail to provide meaningful information in the edges, which may challenge the necessity of using graph structures in these problems. To address these issues, we develop and introduce a collection of synthetic, semi-synthetic, and real-world datasets that fulfill a broad spectrum of requirements. These datasets are thoughtfully designed to include relevant graph structures and bias information crucial for the fair evaluation of models. The proposed synthetic and semi-synthetic datasets offer the flexibility to create data with controllable bias parameters, thereby enabling the generation of desired datasets with user-defined bias values with ease. Moreover, we conduct systematic evaluations of these proposed datasets and establish a unified evaluation approach for fair graph learning models. Our extensive experimental results with fair graph learning methods across our datasets demonstrate their effectiveness in benchmarking the performance of these methods. Our datasets and the code for reproducing our experiments are available at https://github.com/XweiQ/Benchmark-GraphFairness.
- Towards a Unified Framework for Fair and Stable Graph Representation Learning. arXiv:2102.13186Â [cs.LG]
- Siddhant Arora. 2020. A survey on graph neural networks for knowledge graph completion. arXiv preprint arXiv:2007.12374 (2020).
- A unified framework of graph information bottleneck for robustness and membership privacy. In KDD.
- Enyan Dai and Suhang Wang. 2021. Say no to the discrimination: Learning fair graph neural networks with limited sensitive attribute information. In Proceedings of the 14th ACM International Conference on Web Search and Data Mining. 680–688.
- A Comprehensive Survey on Trustworthy Graph Neural Networks: Privacy, Robustness, Fairness, and Explainability. 1, 1 ([n. d.]).
- Bert: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805 (2018).
- EDITS: Modeling and Mitigating Data Bias for Graph Neural Networks.. In The Web Conference (WWW). ACM, 1259–1269.
- Fairness through awareness. In Proceedings of the 3rd innovations in theoretical computer science conference. 214–226.
- Graph neural networks for social recommendation. In The world wide web conference. 417–426.
- Certifying and removing disparate impact. In proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining. 259–268.
- William L. Hamilton. 2020. Graph Representation Learning. Vol. 14. Morgan & Claypool Publishers. 1–159 pages.
- Equality of opportunity in supervised learning. Advances in neural information processing systems 29 (2016).
- Thomas N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016).
- Counterfactual fairness. Advances in neural information processing systems 30 (2017).
- KGNN: Knowledge Graph Neural Network for Drug-Drug Interaction Prediction.. In IJCAI, Vol. 380. 2739–2745.
- Learning fair node representations with graph counterfactual fairness. In Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining. 695–703.
- Learning Adversarially Fair and Transferable Representations.. In ICML. 3381–3390.
- A survey on bias and fairness in machine learning. ACM computing surveys (CSUR) 54, 6 (2021), 1–35.
- Perceptions of fairness in financial services: an analysis of distribution channels. International Journal of Bank Marketing 34, 2 (2016), 171–190.
- Link Prediction with Non-Contrastive Learning. arXiv:2211.14394Â [cs]
- Causal Attention for Interpretable and Generalizable Graph Classification. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. ACM, Washington DC USA, 1696–1705. https://doi.org/10.1145/3534678.3539366
- Harini Suresh and John V Guttag. 2019. A framework for understanding unintended consequences of machine learning. arXiv preprint arXiv:1901.10002 2, 8 (2019).
- Graph Attention Networks.. In International Conference on Learning Representations (ICLR).
- Task-Adaptive Few-Shot Node Classification. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. ACM, Washington DC USA, 1910–1919. https://doi.org/10.1145/3534678.3539265
- Improving Molecular Contrastive Learning via Faulty Negative Mitigation and Decomposed Fragment Contrast. Journal of Chemical Information and Modeling 62, 11 (June 2022), 2713–2725. https://doi.org/10.1021/acs.jcim.2c00495
- Mixup for Node and Graph Classification. In Proceedings of the Web Conference 2021. ACM, Ljubljana Slovenia, 3663–3674. https://doi.org/10.1145/3442381.3449796
- Graph neural networks for automated de novo drug design. Drug Discovery Today 26, 6 (2021), 1382–1393.
- Explainability in Graph Neural Networks: A Taxonomic Survey. IEEE Transactions on Pattern Analysis and Machine Intelligence (2022), 1–19. https://doi.org/10.1109/TPAMI.2022.3204236
- Neo-GNNs: Neighborhood Overlap-Aware Graph Neural Networks for Link Prediction. ([n. d.]).
- Learning Fair Representations.. In International Conference on Machine Learning (ICML). 325–333.
- Muhan Zhang and Yixin Chen. 2018. Link prediction based on graph neural networks. NeurIPS 31 (2018).
- Contrastive Disentangled Learning on Graph for Node Classification. arXiv:2306.11344Â [cs]
- Relational graph neural network with hierarchical attention for knowledge graph completion. In Proceedings of the AAAI conference on artificial intelligence, Vol. 34. 9612–9619.
- Learning from Counterfactual Links for Link Prediction.. In International Conference on Machine Learning (ICML). 26911–26926.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.