{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T04:57:16Z","timestamp":1780721836974,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T00:00:00Z","timestamp":1714435200000},"content-version":"vor","delay-in-days":366,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["NSF OAC-2018627, CCF-2028944, CNS-2112471"],"award-info":[{"award-number":["NSF OAC-2018627, CCF-2028944, CNS-2112471"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,30]]},"DOI":"10.1145\/3543873.3587369","type":"proceedings-article","created":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T11:36:14Z","timestamp":1682681774000},"page":"298-301","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Fair Graph Representation Learning Using a Multi-level Framework"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1365-1772","authenticated-orcid":false,"given":"Yuntian","family":"He","sequence":"first","affiliation":[{"name":"The Ohio State University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1699-5714","authenticated-orcid":false,"given":"Saket","family":"Gurukar","sequence":"additional","affiliation":[{"name":"The Ohio State University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6062-6449","authenticated-orcid":false,"given":"Srinivasan","family":"Parthasarathy","sequence":"additional","affiliation":[{"name":"The Ohio State University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Chirag Agarwal Himabindu Lakkaraju and Marinka Zitnik. 2021. Towards a unified framework for fair and stable graph representation learning. In Uncertainty in Artificial Intelligence. PMLR 2114\u20132124."},{"key":"e_1_3_2_1_2_1","unstructured":"Avishek Bose and William Hamilton. 2019. Compositional fairness constraints for graph embeddings. In ICML. PMLR 715\u2013724."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Sean Current Yuntian He Saket Gurukar and Srinivasan Parthasarathy. 2022. FairEGM: Fair Link Prediction and Recommendation via Emulated Graph Modification. In EAAMO. 1\u201314.","DOI":"10.1145\/3551624.3555287"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Enyan Dai and Suhang Wang. 2021. Say no to the discrimination: Learning fair graph neural networks with limited sensitive attribute information. In WSDM. 680\u2013688.","DOI":"10.1145\/3437963.3441752"},{"key":"e_1_3_2_1_5_1","volume-title":"EDITS: Modeling and mitigating data bias for graph neural networks. In WebConf","author":"Dong Yushun","year":"2022","unstructured":"Yushun Dong, Ninghao Liu, Brian Jalaian, and Jundong Li. 2022. EDITS: Modeling and mitigating data bias for graph neural networks. In WebConf 2022. 1259\u20131269."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090255"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_1_8_1","volume-title":"DistMILE: A Distributed Multi-Level Framework for Scalable Graph Embedding","author":"He Yuntian","unstructured":"Yuntian He, Saket Gurukar, Pouya Kousha, Hari Subramoni, Dhabaleswar\u00a0K Panda, and Srinivasan Parthasarathy. 2021. DistMILE: A Distributed Multi-Level Framework for Scalable Graph Embedding. In HiPC. IEEE, 282\u2013291."},{"key":"e_1_3_2_1_9_1","volume-title":"FairMILE: A Multi-Level Framework for Fair and Scalable Graph Representation Learning. arXiv preprint arXiv:2211.09925","author":"He Yuntian","year":"2022","unstructured":"Yuntian He, Saket Gurukar, and Srinivasan Parthasarathy. 2022. FairMILE: A Multi-Level Framework for Fair and Scalable Graph Representation Learning. arXiv preprint arXiv:2211.09925 (2022)."},{"key":"e_1_3_2_1_10_1","volume-title":"Addressing crime situation forecasting task with temporal graph convolutional neural network approach","author":"Jin Guangyin","unstructured":"Guangyin Jin, Qi Wang, Cunchao Zhu, Yanghe Feng, Jincai Huang, and Jiangping Zhou. 2020. Addressing crime situation forecasting task with temporal graph convolutional neural network approach. In ICMTMA. IEEE, 474\u2013478."},{"key":"e_1_3_2_1_11_1","volume-title":"Kipf and Max Welling","author":"N.","year":"2017","unstructured":"Thomas\u00a0N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In ICLR."},{"key":"e_1_3_2_1_12_1","volume-title":"On information and sufficiency. The annals of mathematical statistics 22, 1","author":"Kullback Solomon","year":"1951","unstructured":"Solomon Kullback and Richard\u00a0A Leibler. 1951. On information and sufficiency. The annals of mathematical statistics 22, 1 (1951), 79\u201386."},{"key":"e_1_3_2_1_13_1","volume-title":"MILE: A Multi-Level Framework for Scalable Graph Embedding. In ICWSM. 361\u2013372.","author":"Liang Jiongqian","year":"2021","unstructured":"Jiongqian Liang, Saket Gurukar, and Srinivasan Parthasarathy. 2021. MILE: A Multi-Level Framework for Scalable Graph Embedding. In ICWSM. 361\u2013372."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Jiezhong Qiu Yuxiao Dong Hao Ma Jian Li Kuansan Wang and Jie Tang. 2018. Network embedding as matrix factorization: Unifying Deepwalk LINE PTE and Node2vec. In WSDM. 459\u2013467.","DOI":"10.1145\/3159652.3159706"},{"key":"e_1_3_2_1_16_1","volume-title":"Fairwalk: Towards Fair Graph Embedding","author":"Rahman Tahleen","year":"2019","unstructured":"Tahleen Rahman, Bartlomiej Surma, Michael Backes, and Yang Zhang. 2019. Fairwalk: Towards Fair Graph Embedding. In IJCAI. AAAI Press, 3289\u20133295."},{"key":"e_1_3_2_1_17_1","volume-title":"International Scientific Conference and International Workshop Present Day Trends of Innovations, Vol.\u00a01.","author":"Takac Lubos","year":"2012","unstructured":"Lubos Takac and Michal Zabovsky. 2012. Data analysis in public social networks. In International Scientific Conference and International Workshop Present Day Trends of Innovations, Vol.\u00a01."},{"key":"e_1_3_2_1_18_1","volume-title":"A semi-supervised graph attentive network for financial fraud detection","author":"Wang Daixin","unstructured":"Daixin Wang, Jianbin Lin, Peng Cui, Quanhui Jia, Zhen Wang, Yanming Fang, Quan Yu, Jun Zhou, Shuang Yang, and Yuan Qi. 2019. A semi-supervised graph attentive network for financial fraud detection. In ICDM. IEEE, 598\u2013607."}],"event":{"name":"WWW '23: The ACM Web Conference 2023","location":"Austin TX USA","acronym":"WWW '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Companion Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543873.3587369","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543873.3587369","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543873.3587369","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T23:49:27Z","timestamp":1755820167000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543873.3587369"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":18,"alternative-id":["10.1145\/3543873.3587369","10.1145\/3543873"],"URL":"https:\/\/doi.org\/10.1145\/3543873.3587369","relation":{},"subject":[],"published":{"date-parts":[[2023,4,30]]},"assertion":[{"value":"2023-04-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}