{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T19:04:55Z","timestamp":1778267095813,"version":"3.51.4"},"reference-count":68,"publisher":"Association for Computing Machinery (ACM)","issue":"2","funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2024YFC3013903"],"award-info":[{"award-number":["2024YFC3013903"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"crossref","award":["2021T140707"],"award-info":[{"award-number":["2021T140707"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Xuzhou K&D Program, China","award":["KC23296"],"award-info":[{"award-number":["KC23296"]}]},{"name":"Australian Research Council, Australia","award":["DP230101122"],"award-info":[{"award-number":["DP230101122"]}]},{"name":"Graduate Innovation Program of China University of Mining and Technology","award":["2024WLKXJ183"],"award-info":[{"award-number":["2024WLKXJ183"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2024-10949"],"award-info":[{"award-number":["2024-10949"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Postgraduate Research & Practice Innovation Program of Jiangsu Province","award":["KYCX24_2781"],"award-info":[{"award-number":["KYCX24_2781"]}]},{"name":"Research Fund of Guangxi Key Lab of Multi-source Information Mining and Security","award":["MIMS24-13"],"award-info":[{"award-number":["MIMS24-13"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2026,4,30]]},"abstract":"<jats:p>\n                    With the widespread use of\n                    <jats:bold>Graph Neural Networks (GNNs)<\/jats:bold>\n                    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\n                    <jats:italic toggle=\"yes\">social homophily<\/jats:italic>\n                    , 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\n                    <jats:bold>Equity-Aware GNN (EAGNN)<\/jats:bold>\n                    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.\n                  <\/jats:p>","DOI":"10.1145\/3785503","type":"journal-article","created":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T16:01:53Z","timestamp":1766073713000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Towards Fair Graph Representation Learning by Overcoming Social Homophily"],"prefix":"10.1145","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7632-8411","authenticated-orcid":false,"given":"Guixian","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology\/School of Artificial Intelligence, China University of Mining and Technology, Xuzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3148-9817","authenticated-orcid":false,"given":"Guan","family":"Yuan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology\/School of Artificial Intelligence, China University of Mining and Technology, Xuzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0383-1462","authenticated-orcid":false,"given":"Debo","family":"Cheng","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Hainan University, Haikou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2843-5738","authenticated-orcid":false,"given":"Lin","family":"Liu","sequence":"additional","affiliation":[{"name":"UniSA STEM, University of South Australia, Adelaide, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9023-1878","authenticated-orcid":false,"given":"Jiuyong","family":"Li","sequence":"additional","affiliation":[{"name":"UniSA STEM, University of South Australia, Adelaide, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9981-2970","authenticated-orcid":false,"given":"Shichao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Guangxi Key Lab of Multisource Information Mining and Security, Guangxi Normal University, Guilin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,2,19]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-72357-6"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1177\/0192513X21994153"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3712699"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330925"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441752"},{"key":"e_1_3_1_7_2","first-page":"1","article-title":"Learning fair graph neural networks with limited and private sensitive attribute information","volume":"35","author":"Dai Enyan","year":"2022","unstructured":"Enyan Dai and Suhang Wang. 2022. Learning fair graph neural networks with limited and private sensitive attribute information. IEEE Transactions on Knowledge & Data Engineering 35 (2022), 1\u201314.","journal-title":"IEEE Transactions on Knowledge & Data Engineering"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3450528"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3605894"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3630260"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512173"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3265598"},{"key":"e_1_3_1_13_2","unstructured":"Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository. Retrieved from http:\/\/archive.ics.uci.edu\/ml"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090255"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583403"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3690650"},{"key":"e_1_3_1_17_2","first-page":"2672","article-title":"Generative adversarial nets","volume":"27","author":"Goodfellow Ian","year":"2014","unstructured":"Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. 2014. Generative adversarial nets. In Advances in Neural Information Processing Systems 27, 2672\u20132680.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3615092"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.5555\/3294771.3294869"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.5555\/3157382.3157469"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3617694.3623231"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539321"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645627"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599362"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645460"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1080\/15377938.2014.984045"},{"key":"e_1_3_1_27_2","volume-title":"Proceedings of the International Conference on Learning Representations","author":"Kipf Thomas N.","year":"2017","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In Proceedings of the International Conference on Learning Representations. Retrieved from https:\/\/openreview.net\/forum?id=SJU4ayYgl"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.112635"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2024.106919"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671826"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i12.33342"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671834"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-022-01008-3"},{"key":"e_1_3_1_34_2","volume-title":"Proceedings of the 10th International Conference on Learning Representations (ICLR \u201922)","author":"Ma Yao","year":"2022","unstructured":"Yao Ma, Xiaorui Liu, Neil Shah, and Jiliang Tang. 2022. Is homophily a necessity for graph neural networks? In Proceedings of the 10th International Conference on Learning Representations (ICLR \u201922)."},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1001\/jama.2020.11374"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3655631"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3457607"},{"key":"e_1_3_1_39_2","volume-title":"Proceedings of the 10th International Conference on Learning Representations (ICLR \u201922)","author":"Park Joonhyung","year":"2022","unstructured":"Joonhyung Park, Jaeyun Song, and Eunho Yang. 2022. GraphENS: Neighbor-aware ego network synthesis for class-imbalanced node classification. In Proceedings of the 10th International Conference on Learning Representations (ICLR \u201922)."},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803161"},{"key":"e_1_3_1_41_2","first-page":"1594","volume-title":"Proceedings of the International Conference on Artificial Intelligence and Statistics","author":"Sohn Jinwon","year":"2024","unstructured":"Jinwon Sohn, Qifan Song, and Guang Lin. 2024. Fair supervised learning with a simple random sampler of sensitive attributes. In Proceedings of the International Conference on Artificial Intelligence and Statistics. PMLR, 1594\u20131602."},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645609"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186140"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449822"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/3664647.3681334"},{"key":"e_1_3_1_46_2","volume-title":"Proceedings of the International Scientific Conference and International Workshop Present Day Trends of Innovations","volume":"1","author":"Takac Lubos","year":"2012","unstructured":"Lubos Takac and Michal Zabovsky. 2012. Data analysis in public social networks. In Proceedings of the International Scientific Conference and International Workshop Present Day Trends of Innovations, Vol. 1."},{"key":"e_1_3_1_47_2","first-page":"33940","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Teneggi Jacopo","year":"2023","unstructured":"Jacopo Teneggi, Matthew Tivnan, Web Stayman, and Jeremias Sulam. 2023. How to trust your diffusion model: A convex optimization approach to conformal risk control. In Proceedings of the International Conference on Machine Learning. PMLR, 33940\u201333960."},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512189"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539404"},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i12.33400"},{"key":"e_1_3_1_51_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.111872"},{"key":"e_1_3_1_52_2","volume-title":"Proceedings of the International Conference on Learning Representations","author":"Xu Keyulu","year":"2019","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2019. How powerful are graph neural networks? In Proceedings of the International Conference on Learning Representations. Retrieved from https:\/\/openreview.net\/forum?id=ryGs6iA5Km"},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3696410.3714883"},{"key":"e_1_3_1_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570386"},{"key":"e_1_3_1_55_2","doi-asserted-by":"crossref","unstructured":"Cheng Yang Jixi Liu Yunhe Yan and Chuan Shi. 2024. FairSIN: Achieving fairness in graph neural networks through sensitive information neutralization. In Proceedings of the AAAI Conference on Artificial Intelligence Vol. 38 9241\u20139249.","DOI":"10.1609\/aaai.v38i8.28776"},{"key":"e_1_3_1_56_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109973"},{"key":"e_1_3_1_57_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2007.12.020"},{"key":"e_1_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2023.103570"},{"key":"e_1_3_1_59_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2024.106781"},{"key":"e_1_3_1_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/3736404"},{"key":"e_1_3_1_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/3639408"},{"key":"e_1_3_1_62_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2025.3574976"},{"key":"e_1_3_1_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599494"},{"issue":"3","key":"e_1_3_1_64_2","first-page":"2711","article-title":"KNN classification with one-step computation","volume":"35","author":"Zhang Shichao","year":"2021","unstructured":"Shichao Zhang and Jiaye Li. 2021. KNN classification with one-step computation. IEEE Transactions on Knowledge and Data Engineering 35, 3 (2021), 2711\u20132723.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_1_65_2","doi-asserted-by":"publisher","DOI":"10.1145\/2990508"},{"key":"e_1_3_1_66_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2673241"},{"key":"e_1_3_1_67_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583511"},{"key":"e_1_3_1_68_2","doi-asserted-by":"publisher","DOI":"10.1145\/3664928"},{"key":"e_1_3_1_69_2","first-page":"7793","volume-title":"Proceedings of the 34th International Conference on Neural Information Processing Systems","author":"Zhu Jiong","year":"2020","unstructured":"Jiong Zhu, Yujun Yan, Lingxiao Zhao, Mark Heimann, Leman Akoglu, and Danai Koutra. 2020. Beyond homophily in graph neural networks: Current limitations and effective designs. In Proceedings of the 34th International Conference on Neural Information Processing Systems, 7793\u20137804."}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3785503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T12:33:03Z","timestamp":1772800383000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3785503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,19]]},"references-count":68,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4,30]]}},"alternative-id":["10.1145\/3785503"],"URL":"https:\/\/doi.org\/10.1145\/3785503","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"value":"2157-6904","type":"print"},{"value":"2157-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,19]]},"assertion":[{"value":"2025-02-14","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-09","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}