{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,2]],"date-time":"2026-08-02T23:48:18Z","timestamp":1785714498650,"version":"3.56.0"},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Soc. Syst."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1109\/tcss.2024.3479702","type":"journal-article","created":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T18:58:51Z","timestamp":1731956331000},"page":"998-1012","source":"Crossref","is-referenced-by-count":4,"title":["Fair Link Prediction With Overlapping Groups"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9280-6938","authenticated-orcid":false,"given":"Manjish","family":"Pal","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, IIT Kharagpur, Kharagpur, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8957-7364","authenticated-orcid":false,"given":"Sandipan","family":"Sikdar","sequence":"additional","affiliation":[{"name":"Leibniz University of Hanover, Hanover, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3967-186X","authenticated-orcid":false,"given":"Niloy","family":"Ganguly","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, IIT Kharagpur, Kharagpur, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"ref2","first-page":"798","article-title":"Link prediction using supervised learning","volume-title":"Proc. Workshop link Anal., Counter-Terrorism Secur. (SDM)","volume":"30","author":"Hasan","year":"2006"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2808797.2809407"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2018.8508500"},{"key":"ref5","volume-title":"The Filter Bubble: What the Internet Is Hiding From You","author":"Pariser","year":"2011"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1177\/0003122417705656"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.05.028"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2011-20207-x"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9162"},{"key":"ref11","first-page":"1220","article-title":"Debayes: a bayesian method for debiasing network embeddings","volume-title":"Int. Conf. Mach. Learn. (PMLR)","author":"Buyl","year":"2020"},{"key":"ref12","article-title":"A survey on fairness for machine learning on graphs","author":"Choudhary","year":"2022"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2023.3265598"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/aaai.12212"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098095"},{"issue":"258","key":"ref16","first-page":"1","article-title":"Optimized score transformation for consistent fair classification","volume":"22","author":"Wei","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105740"},{"key":"ref18","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2016"},{"key":"ref19","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017"},{"key":"ref20","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Hamilton","year":"2017"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449835"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-86520-7_22"},{"key":"ref23","article-title":"On dyadic fairness: Exploring and mitigating bias in graph connections","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Li","year":"2020"},{"key":"ref24","first-page":"1774","article-title":"All of the fairness for edge prediction with optimal transport","volume-title":"Proc. Int. Conf. Artif. Intell. Statist. (PMLR)","author":"Laclau","year":"2021"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512189"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/456"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i11.21454"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5429"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3551624.3555287"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2021.3133818"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512173"},{"key":"ref32","article-title":"MONET: Debiasing graph embeddings via the metadata-orthogonal training unit","author":"Palowitch","year":"2019"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1609\/icwsm.v15i1.18111"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449799"},{"key":"ref35","first-page":"715","article-title":"Compositional fairness constraints for graph embeddings","volume-title":"Proc. Int. Conf. Mach. Learn","author":"Bose","year":"2019"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i8.28776"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110589"},{"key":"ref38","first-page":"107","article-title":"The cost of fairness in binary classification","volume-title":"Proc. Conf. Fairness Accountability Transparency (PMLR)","author":"Menon","year":"2018"},{"key":"ref39","article-title":"Optimal transport of classifiers to fairness","author":"Buyl","year":"2022"},{"key":"ref40","first-page":"7321","article-title":"Fair regression with wasserstein barycenters","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Chzhen","year":"2020"},{"key":"ref41","first-page":"862","article-title":"Wasserstein fair classification","volume-title":"Proc. Uncertainty Artif. Intell. (PMLR)","author":"Jiang","year":"2020"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5771"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-019-00658-8"},{"key":"ref44","volume-title":"On Intersectionality: Essential Writings","author":"Crenshaw","year":"2017"},{"key":"ref45","first-page":"60","article-title":"A reductions approach to fair classification","volume-title":"Int. Conf. Mach. Learn. (PMLR)","author":"Agarwal","year":"2018"},{"key":"ref46","article-title":"Equality of opportunity in supervised learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"29","author":"Hardt","year":"2016"},{"key":"ref47","first-page":"2564","article-title":"Preventing fairness gerrymandering: Auditing and learning for subgroup fairness","volume-title":"Proc. Int. Conf. Mach. Learn. (PMLR)","author":"Kearns","year":"2018"},{"key":"ref48","first-page":"4067","article-title":"Fairness with overlapping groups; a probabilistic perspective","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Yang","year":"2020"},{"issue":"1","key":"ref49","first-page":"2737","article-title":"Fairness constraints: A flexible approach for fair classification","volume":"20","author":"Zafar","year":"2019","journal-title":"J. Mach. Learn. Res."},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/3442188.3445887"},{"key":"ref51","first-page":"77","article-title":"Gender shades: Intersectional accuracy disparities in commercial gender classification","volume-title":"Proc. Conf. Fairness Accountability Transparency (PMLR)","author":"Buolamwini","year":"2018"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref54","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn. (PMLR)","author":"Wu","year":"2019"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/2382577.2382579"},{"key":"ref56","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/BF01587086"},{"key":"ref58","volume-title":"Fairness and Machine Learning: Limitations and Opportunities","author":"Barocas","year":"2019"}],"container-title":["IEEE Transactions on Computational Social Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6570650\/11018518\/10755960.pdf?arnumber=10755960","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T04:55:38Z","timestamp":1748667338000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10755960\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":58,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tcss.2024.3479702","relation":{},"ISSN":["2329-924X","2373-7476"],"issn-type":[{"value":"2329-924X","type":"electronic"},{"value":"2373-7476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6]]}}}