{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T11:31:47Z","timestamp":1762342307348,"version":"3.37.3"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"publisher","award":["2022YFF0902500"],"award-info":[{"award-number":["2022YFF0902500"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangdong Basic and Applied Basic Research Foundation, China","award":["2023A1515011050"],"award-info":[{"award-number":["2023A1515011050"]}]},{"name":"Shenzhen Research Project","award":["KJZD20231023094501003"],"award-info":[{"award-number":["KJZD20231023094501003"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Soc. Syst."],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1109\/tcss.2024.3385539","type":"journal-article","created":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T17:32:37Z","timestamp":1714584757000},"page":"6308-6319","source":"Crossref","is-referenced-by-count":1,"title":["FairAGG: Toward Fair Graph Neural Networks via Fair Aggregation"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5474-5671","authenticated-orcid":false,"given":"Yuchang","family":"Zhu","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6405-1531","authenticated-orcid":false,"given":"Jintang","family":"Li","sequence":"additional","affiliation":[{"name":"School of Software Engineering, Sun Yat-sen University, Zhuhai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3787-8832","authenticated-orcid":false,"given":"Liang","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7872-7718","authenticated-orcid":false,"given":"Zibin","family":"Zheng","sequence":"additional","affiliation":[{"name":"School of Software Engineering, Sun Yat-sen University, Zhuhai, China"}]}],"member":"263","reference":[{"article-title":"Semi-supervised classification with graph convolutional networks","year":"2016","author":"Kipf","key":"ref1"},{"key":"ref2","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Hamilton","year":"2017"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090255"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/456"},{"key":"ref5","article-title":"On dyadic fairness: Exploring and mitigating bias in graph connections","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Li","year":"2021"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2021.3133818"},{"key":"ref7","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","year":"2021"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441752"},{"article-title":"FMP: Toward fair graph message passing against topology bias","year":"2022","author":"Jiang","key":"ref9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"ref11","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Zhu","year":"2020"},{"article-title":"Is homophily a necessity for graph neural networks?","year":"2021","author":"Ma","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3490478"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/icwsm.v15i1.18111"},{"article-title":"FairEdit: Preserving fairness in graph neural networks through greedy graph editing","year":"2022","author":"Loveland","key":"ref16"},{"key":"ref17","first-page":"715","article-title":"Compositional fairness constraints for graph embeddings","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Bose","year":"2019"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512173"},{"key":"ref19","first-page":"1774","article-title":"All of the fairness for edge prediction with optimal transport","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Laclau","year":"2021"},{"article-title":"Fairness-aware node representation learning","year":"2021","author":"K\u00f6se","key":"ref20"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539404"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM51629.2021.00194"},{"key":"ref23","first-page":"1220","article-title":"DeBayes: A Bayesian method for debiasing network embeddings","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Buyl","year":"2020"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref25","first-page":"841","article-title":"N-GCN: Multi-scale graph convolution for semi-supervised node classification","volume-title":"Proc. 35th Uncertainty Artif. Intell. Conf.","author":"Abu-El-Haija","year":"2020"},{"key":"ref26","first-page":"5171","article-title":"Link prediction based on graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Zhang","year":"2018"},{"key":"ref27","first-page":"294","article-title":"Contextual graph Markov model: A deep and generative approach to graph processing","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Bacciu","year":"2018"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/72.572108"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2005.1555942"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2010.5596796"},{"article-title":"Spectral networks and locally connected networks on graphs","year":"2013","author":"Bruna","key":"ref32"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2010.04.005"},{"key":"ref34","first-page":"3837","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"29","author":"Defferrard","year":"2016"},{"article-title":"FastGCN: Fast learning with graph convolutional networks via importance sampling","year":"2018","author":"Chen","key":"ref35"},{"key":"ref36","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu","year":"2019"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"article-title":"Graph attention networks","year":"2017","author":"Velickovi\u0107","key":"ref38"},{"key":"ref39","first-page":"5453","article-title":"Representation learning on graphs with jumping knowledge networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xu","year":"2018"},{"article-title":"How powerful are graph neural networks?","year":"2018","author":"Xu","key":"ref40"},{"issue":"3","key":"ref41","first-page":"4","article-title":"Deep graph infomax","volume-title":"Proc. Int. Conf. Lear. Representations (ICLR)","volume":"2","author":"Velickovic","year":"2019"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.576"},{"key":"ref43","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gilmer","year":"2017"},{"article-title":"A survey on fairness for machine learning on graphs","year":"2022","author":"Choudhary","key":"ref44"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i11.21454"},{"article-title":"FairMod: Fair link prediction and recommendation via graph modification","year":"2022","author":"Current","key":"ref46"},{"article-title":"Fair node representation learning via adaptive data augmentation","year":"2022","author":"Kose","key":"ref47"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403080"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467266"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/3340631.3394860"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512169"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/594"},{"key":"ref53","first-page":"3315","article-title":"Equality of opportunity in supervised learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"29","author":"Hardt","year":"2016"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2011.12.021"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-86520-7_19"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.2307\/j.ctv173f1fh.12"},{"key":"ref57","first-page":"2242","article-title":"Data shapley: Equitable valuation of data for machine learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ghorbani","year":"2019"},{"key":"ref58","first-page":"4765","article-title":"A unified approach to interpreting model predictions","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Lundberg","year":"2017"},{"issue":"6","key":"ref59","article-title":"Data analysis in public social networks","volume-title":"Proc. Int. Sci. Conf. Int. Workshop Present Day Trends Innov.","volume":"1","author":"Takac","year":"2012"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330961"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313562"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"article-title":"Distilling the knowledge in a neural network","year":"2015","author":"Hinton","key":"ref63"}],"container-title":["IEEE Transactions on Computational Social Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6570650\/10704022\/10516580.pdf?arnumber=10516580","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T19:15:59Z","timestamp":1733339759000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10516580\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10]]},"references-count":63,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tcss.2024.3385539","relation":{},"ISSN":["2329-924X","2373-7476"],"issn-type":[{"type":"electronic","value":"2329-924X"},{"type":"electronic","value":"2373-7476"}],"subject":[],"published":{"date-parts":[[2024,10]]}}}