{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T00:40:49Z","timestamp":1780620049754,"version":"3.54.1"},"reference-count":79,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"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. Knowl. Data Eng."],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1109\/tkde.2023.3306378","type":"journal-article","created":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T17:24:22Z","timestamp":1692984262000},"page":"1537-1551","source":"Crossref","is-referenced-by-count":6,"title":["FairSample: Training Fair and Accurate Graph Convolutional Neural Networks Efficiently"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7937-1936","authenticated-orcid":false,"given":"Zicun","family":"Cong","sequence":"first","affiliation":[{"name":"School of Computing Science, Simon Fraser University, Burnaby, BC, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7026-5811","authenticated-orcid":false,"given":"Baoxu","family":"Shi","sequence":"additional","affiliation":[{"name":"LinkedIn Corporation, Sunnnyvale, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-2822-2392","authenticated-orcid":false,"given":"Shan","family":"Li","sequence":"additional","affiliation":[{"name":"LinkedIn Corporation, Sunnnyvale, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2224-7915","authenticated-orcid":false,"given":"Jaewon","family":"Yang","sequence":"additional","affiliation":[{"name":"LinkedIn Corporation, Sunnnyvale, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5257-6843","authenticated-orcid":false,"given":"Qi","family":"He","sequence":"additional","affiliation":[{"name":"LinkedIn Corporation, Sunnnyvale, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2200-8711","authenticated-orcid":false,"given":"Jian","family":"Pei","sequence":"additional","affiliation":[{"name":"School of Computing Science, Simon Fraser University, Burnaby, BC, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"4563","article-title":"Adaptive sampling towards fast graph representation learning","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Huang"},{"key":"ref2","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN52387.2021.9533402"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403092"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441752"},{"key":"ref7","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"},{"key":"ref8","first-page":"1","article-title":"On dyadic fairness: Exploring and mitigating bias in graph connections","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Li"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3457607"},{"key":"ref10","first-page":"60","article-title":"A reductions approach to fair classification","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Agarwal"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/456"},{"key":"ref12","article-title":"Fair data representation for machine learning at the Pareto frontier","author":"Xu","year":"2022"},{"key":"ref13","volume-title":"Fairness and Machine Learning","author":"Barocas","year":"2019"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20978"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512173"},{"key":"ref16","first-page":"2114","article-title":"Towards a unified framework for fair and stable graph representation learning","volume-title":"Proc. 27th Conf. Uncertainty Artif.","author":"Agarwal"},{"key":"ref17","first-page":"107","article-title":"The cost of fairness in binary classification","volume-title":"Proc. Conf. Fairness Accountability Transparency","author":"Menon"},{"key":"ref18","first-page":"57:1","article-title":"Inherent tradeoffs in learning fair representations","volume":"23","author":"Zhao","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref19","first-page":"715","article-title":"Compositional fairness constraints for graph embeddings","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Bose"},{"key":"ref20","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref21","article-title":"FastGCN: Fast learning with graph convolutional networks via importance sampling","author":"Chen","year":"2018"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467284"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.50"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-011-0463-8"},{"key":"ref25","first-page":"502","article-title":"K-NN as an implementation of situation testing for discrimination discovery and prevention","volume-title":"Proc. ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining","author":"Thanh"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.72"},{"key":"ref27","first-page":"277","article-title":"Fair decisions despite imperfect predictions","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Kilbertus"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783311"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.45"},{"key":"ref30","first-page":"1774","article-title":"Enhancing the accuracy and fairness of human decision making","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Valera"},{"key":"ref31","first-page":"2796","article-title":"Empirical risk minimization under fairness constraints","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Donini"},{"key":"ref32","article-title":"FNNC: Achieving fairness through neural networks","volume-title":"Proc. Int. Joint Conf. Artif. Intell.","author":"Manisha"},{"key":"ref33","first-page":"31","article-title":"Learning deep fair graph neural networks","volume-title":"Proc. Eur. Symp. Artif. Neural Netw. Comput. Intell. Mach. Learn.","author":"Oneto"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref35","article-title":"Fair node representation learning via adaptive data augmentation","author":"Kose","year":"2022"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498391"},{"key":"ref37","first-page":"4069","article-title":"Counterfactual fairness","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Kusner"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467266"},{"key":"ref39","first-page":"1048","article-title":"Subgroup generalization and fairness of graph neural networks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Ma"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411872"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512169"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330941"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403296"},{"key":"ref44","article-title":"Bandit samplers for training graph neural networks","author":"Liu","year":"2020"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403192"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403142"},{"key":"ref47","first-page":"1","article-title":"EXACT: Scalable graph neural networks training via extreme activation compression","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Liu"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090255"},{"key":"ref49","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5330"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401137"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/3535101"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/477"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1802.05957"},{"key":"ref55","first-page":"3995","article-title":"Optimized pre-processing for discrimination prevention","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"du Pin Calmon"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467364"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17315"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00521"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401984"},{"key":"ref60","article-title":"Simple and deep graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403076"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1561\/2200000071"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/3306618.3314234"},{"key":"ref64","first-page":"1","article-title":"Data analysis in public social networks","volume-title":"Proc. Int. Sci. Conf. Int. Workshop Present Day Trends Innov.","author":"Takac"},{"key":"ref65","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Velickovic"},{"key":"ref66","first-page":"1","article-title":"Deep graph infomax","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Velickovic"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"},{"key":"ref68","volume-title":"Deep Learning","author":"Goodfellow","year":"2016"},{"key":"ref69","volume-title":"FairGNN","year":"2022"},{"key":"ref70","volume-title":"DGI","year":"2022"},{"key":"ref71","volume-title":"GCA","year":"2022"},{"key":"ref72","volume-title":"FairAdj","year":"2022"},{"key":"ref73","volume-title":"FCGE","year":"2022"},{"key":"ref74","volume-title":"Edits","year":"2022"},{"key":"ref75","volume-title":"Nifty","year":"2022"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1145\/3461702.3462614"},{"key":"ref77","article-title":"FedFair: Training fair models in cross-silo federated learning","author":"Chu","year":"2021"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/isap.2005.1599245"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1002\/9780471462422.eoct979"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10462568\/10231087.pdf?arnumber=10231087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T02:34:43Z","timestamp":1709865283000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10231087\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4]]},"references-count":79,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2023.3306378","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4]]}}}