Towards Fair Graph Representation Learning by Overcoming Social Homophily
ACM Transactions on Intelligent Systems and Technology · 30.04.2026 · 17 (2) · 1-25
DOI: 10.1145/3785503 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Intelligent Systems and Technology, online erschienen am 19.02.2026. Verfasst von Guixian Zhang und 5 weiteren Autor:innen. Die Arbeit wurde bisher 12-mal zitiert (Crossref) und nennt 68 Literaturangaben. Gefördert von: National Key R&D Program of China, China Postdoctoral Science Foundation, Xuzhou K&D Program, China.
Abstract (Originalsprache)
With the widespread use of Graph Neural Networks (GNNs) for representation learning from network data, the fairness of GNN models has raised great attention lately. Fair GNNs aim to ensure that node representations can be accurately classified, but not easily associated with a specific group. Existing advanced approaches essentially enhance the generalisation of node representation in combination with data augmentation strategy and do not directly impose constraints on the fairness of GNNs. In this work, we identify that a fundamental reason for the unfairness of GNNs is the phenomenon of social homophily , i.e., users in the same group are more inclined to congregate. The message-passing mechanism of GNNs can cause users in the same group to have similar representations due to social homophily, leading model predictions to establish spurious correlations with sensitive attributes. Inspired by this reason, we propose a method called Equity-Aware GNN (EAGNN) towards fair graph representation learning. Specifically, to ensure that model predictions are independent of sensitive attributes while maintaining prediction performance, we introduce constraints for fair representation learning based on three principles: sufficiency, independence and separation. We theoretically demonstrate that our EAGNN method can effectively achieve group fairness. Extensive experiments on three datasets with varying levels of social homophily illustrate that our EAGNN method achieves the state-of-the-art performance across two fairness metrics and offers competitive effectiveness.
Förderung
- National Key R&D Program of China
- China Postdoctoral Science Foundation
- Xuzhou K&D Program, China
- Australian Research Council, Australia
- Graduate Innovation Program of China University of Mining and Technology
- Fundamental Research Funds for the Central Universities
- Postgraduate Research & Practice Innovation Program of Jiangsu Province
- Research Fund of Guangxi Key Lab of Multi-source Information Mining and Security
Zitieren
APA
Zhang, G., Yuan, G., Cheng, D., Liu, L., Li, J., & Zhang, S. (2026). Towards Fair Graph Representation Learning by Overcoming Social Homophily. ACM Transactions on Intelligent Systems and Technology, 17(2), 1-25. https://doi.org/10.1145/3785503
Vancouver
Zhang G, Yuan G, Cheng D, Liu L, Li J, Zhang S. Towards Fair Graph Representation Learning by Overcoming Social Homophily. ACM Transactions on Intelligent Systems and Technology. 2026;17(2):1-25. doi:10.1145/3785503
BibTeX
@article{Zhang2026,
author = {Zhang, Guixian and Yuan, Guan and Cheng, Debo and Liu, Lin and Li, Jiuyong and Zhang, Shichao},
title = {Towards Fair Graph Representation Learning by Overcoming Social Homophily},
journal = {ACM Transactions on Intelligent Systems and Technology},
year = {2026},
volume = {17},
number = {2},
pages = {1--25},
doi = {10.1145/3785503}
}
EUVIMED