{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T01:32:24Z","timestamp":1784597544379,"version":"3.55.0"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Hong Kong (HK) Research Grant Council (RGC) General Research Fund","award":["PolyU 15208222"],"award-info":[{"award-number":["PolyU 15208222"]}]},{"name":"NSFC Young Scientist Fund","award":["PolyU A0040473"],"award-info":[{"award-number":["PolyU A0040473"]}]},{"DOI":"10.13039\/501100001809","name":"Hong Kong RGC Theme-Based Research Scheme","doi-asserted-by":"publisher","award":["T43-513\/23-N"],"award-info":[{"award-number":["T43-513\/23-N"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1109\/tnnls.2024.3492055","type":"journal-article","created":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T13:39:16Z","timestamp":1731591556000},"page":"11092-11105","source":"Crossref","is-referenced-by-count":3,"title":["Debiasing Graph Representation Learning Based on Information Bottleneck"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7856-7301","authenticated-orcid":false,"given":"Ziyi","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Software Engineering, South China University of Technology, Guangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4988-9134","authenticated-orcid":false,"given":"Mingxuan","family":"Ouyang","sequence":"additional","affiliation":[{"name":"Department of Data Science and Artificial Intelligence, The Hong Kong Polytechnic University, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7328-8039","authenticated-orcid":false,"given":"Wanyu","family":"Lin","sequence":"additional","affiliation":[{"name":"Department of Computing, Department of Data Science and Artificial Intelligence, The Hong Kong Polytechnic University, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8855-4072","authenticated-orcid":false,"given":"Hao","family":"Lan","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8732-3675","authenticated-orcid":false,"given":"Lei","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Software Engineering, South China University of Technology, Guangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488814"},{"key":"ref3","article-title":"Deep learning on knowledge graph for recommender system: A survey","author":"Gao","year":"2020","journal-title":"arXiv:2004.00387"},{"key":"ref4","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","volume":"70","author":"Gilmer"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2024.3443074"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3320269.3384750"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00423"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/tdsc.2024.3417513"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/643"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3390\/s21144758"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441752"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512173"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3457607"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i19.30168"},{"key":"ref15","first-page":"1","article-title":"Learning fair graph representations via automated data augmentations","volume-title":"Proc. 11th Int. Conf. Learn. Represent.","author":"Ling"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i8.28776"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772752"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2007.12.020"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498391"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450015"},{"key":"ref23","first-page":"2114","article-title":"Towards a unified framework for fair and stable graph representation learning","volume-title":"Proc. 37th Conf. Uncertainty Artif. Intell.","author":"Agarwal"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539404"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098167"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1089\/big.2016.0048"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-86520-7_22"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539302"},{"key":"ref29","first-page":"1436","article-title":"Flexibly fair representation learning by disentanglement","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Creager"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539232"},{"key":"ref31","article-title":"Towards principled methods for training generative adversarial networks","author":"Arjovsky","year":"2017","journal-title":"arXiv:1701.04862"},{"key":"ref32","article-title":"Variational graph auto-encoders","author":"Kipf","year":"2016","journal-title":"arXiv:1611.07308"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611429"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1609.02907"},{"key":"ref35","first-page":"1","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Hamilton"},{"key":"ref36","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017","journal-title":"arXiv:1710.10903"},{"key":"ref37","article-title":"Modeling techniques for machine learning fairness: A survey","author":"Wan","year":"2021","journal-title":"arXiv:2111.03015"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2023.3265598"},{"key":"ref39","article-title":"Fairness-aware message passing for graph neural networks","author":"Zhu","year":"2023","journal-title":"arXiv:2306.11132"},{"key":"ref40","article-title":"On dyadic fairness: Exploring and mitigating bias in graph connections","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Li"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403080"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2021.3133818"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2024\/50"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"ref45","first-page":"368","article-title":"The information bottleneck method","volume-title":"Proc. 37th Annu. Allerton Conf. Commun., Control Comput.","author":"Tishby"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2024.3366349"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3238041"},{"key":"ref48","first-page":"20437","article-title":"Graph information bottleneck","volume-title":"Proc. Annu. Conf. Adv. Neural Inf. Process.","author":"Wu"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1312.6114"},{"key":"ref50","article-title":"Deep variational information bottleneck","author":"Alemi","year":"2016","journal-title":"arXiv:1612.00410"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i12.26776"},{"key":"ref52","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2018","journal-title":"arXiv:1810.00826"},{"key":"ref53","first-page":"1","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"29","author":"Defferrard"},{"key":"ref54","first-page":"1","article-title":"Improved variational inference with inverse autoregressive flow","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"29","author":"Kingma"},{"issue":"320","key":"ref55","first-page":"201","article-title":"The IM algorithm: A variational approach to information maximization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"16","author":"Agakov"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.3390\/e21121181"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/5962385\/11022714\/10753070.pdf?arnumber=10753070","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T18:41:17Z","timestamp":1765219277000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10753070\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":56,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2024.3492055","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6]]}}}