{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:07:49Z","timestamp":1775815669292,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T00:00:00Z","timestamp":1724457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Hong Kong Research Grants Council under Theme-based Research Scheme","award":["T43-513\/23-N, T41-603\/20-R"],"award-info":[{"award-number":["T43-513\/23-N, T41-603\/20-R"]}]},{"name":"Australian Research Council (ARC)","award":["DP220103717, LE220100078"],"award-info":[{"award-number":["DP220103717, LE220100078"]}]},{"name":"Hong Kong Research Grants Council under Research Impact Fund","award":["R5034-18"],"award-info":[{"award-number":["R5034-18"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,8,25]]},"DOI":"10.1145\/3637528.3671848","type":"proceedings-article","created":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T04:55:12Z","timestamp":1724561712000},"page":"1701-1712","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Toward Structure Fairness in Dynamic Graph Embedding: A Trend-aware Dual Debiasing Approach"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7905-4885","authenticated-orcid":false,"given":"Yicong","family":"Li","sequence":"first","affiliation":[{"name":"The Education University of Hong Kong & University of Technology Sydney, Hong Kong, Hong Kong"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9354-3909","authenticated-orcid":false,"given":"Yu","family":"Yang","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University, Hong Kong, Hong Kong"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2725-2529","authenticated-orcid":false,"given":"Jiannong","family":"Cao","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University, Hong Kong, Hong Kong"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6754-1587","authenticated-orcid":false,"given":"Shuaiqi","family":"Liu","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University, Hong Kong, Hong Kong"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0700-8710","authenticated-orcid":false,"given":"Haoran","family":"Tang","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University, Hong Kong, Hong Kong"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4493-6663","authenticated-orcid":false,"given":"Guandong","family":"Xu","sequence":"additional","affiliation":[{"name":"The Education University of Hong Kong & University of Technology Sydney, Hong Kong, Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2024,8,24]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Emergence of scaling in random networks. science","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"1999","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert. 1999. Emergence of scaling in random networks. science, Vol. 286, 5439 (1999), 509--512."},{"key":"e_1_3_2_2_2_1","volume-title":"Big data's disparate impact. California law review","author":"Barocas Solon","year":"2016","unstructured":"Solon Barocas and Andrew D Selbst. 2016. Big data's disparate impact. California law review (2016), 671--732."},{"key":"e_1_3_2_2_3_1","first-page":"2021","article-title":"Time and space complexity of graph convolutional networks. Accessed on","volume":"31","author":"Blakely Derrick","year":"2021","unstructured":"Derrick Blakely, Jack Lanchantin, and Yanjun Qi. 2021. Time and space complexity of graph convolutional networks. Accessed on: Dec, Vol. 31 (2021), 2021.","journal-title":"Dec"},{"key":"e_1_3_2_2_4_1","unstructured":"Ines Chami Zhitao Ying Christopher R\u00e9 and Jure Leskovec. 2019. Hyperbolic graph convolutional neural networks. In Advances in Neural Information Processing Systems. 4869--4880."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441762"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498408"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441752"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090255"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401051"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531973"},{"key":"e_1_3_2_2_11_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)."},{"key":"e_1_3_2_2_12_1","first-page":"22","article-title":"Algorithmic fairness. In Aea papers and proceedings, Vol. 108. American Economic Association 2014 Broadway","volume":"37203","author":"Kleinberg Jon","year":"2018","unstructured":"Jon Kleinberg, Jens Ludwig, Sendhil Mullainathan, and Ashesh Rambachan. 2018. Algorithmic fairness. In Aea papers and proceedings, Vol. 108. American Economic Association 2014 Broadway, Suite 305, Nashville, TN 37203, 22--27.","journal-title":"Suite 305, Nashville, TN"},{"key":"e_1_3_2_2_13_1","volume-title":"Fairness-aware node representation learning. arXiv preprint arXiv:2106.05391","author":"K\u00f6se \u00d6yk\u00fc Deniz","year":"2021","unstructured":"\u00d6yk\u00fc Deniz K\u00f6se and Yanning Shen. 2021. Fairness-aware node representation learning. arXiv preprint arXiv:2106.05391 (2021)."},{"key":"e_1_3_2_2_14_1","first-page":"1","article-title":"EARLY: Efficient and Reliable Graph Neural Network for Dynamic Graphs","volume":"1","author":"Li Haoyang","year":"2023","unstructured":"Haoyang Li and Lei Chen. 2023. EARLY: Efficient and Reliable Graph Neural Network for Dynamic Graphs. Proceedings of the ACM on Management of Data, Vol. 1, 2 (2023), 1--28.","journal-title":"Proceedings of the ACM on Management of Data"},{"key":"e_1_3_2_2_15_1","volume-title":"Attention Is Not the Only Choice: Counterfactual Reasoning for Path-Based Explainable Recommendation","author":"Li Yicong","year":"2024","unstructured":"Yicong Li, Xiangguo Sun, Hongxu Chen, Sixiao Zhang, Yu Yang, and Guandong Xu. 2024. Attention Is Not the Only Choice: Counterfactual Reasoning for Path-Based Explainable Recommendation. IEEE TKDE (mar 2024), 1--14."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467276"},{"key":"e_1_3_2_2_17_1","volume-title":"Proceedings of the 37th AAAI. 7--14","author":"Liu Zemin","year":"2023","unstructured":"Zemin Liu, Trung Kien Nguyen, and Yuan Fang. 2023. On generalized degree fairness in graph neural networks.(2023). In Proceedings of the 37th AAAI. 7--14."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583207"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411910"},{"key":"e_1_3_2_2_20_1","volume-title":"NeurIPS","volume":"30","author":"Nickel Maximillian","year":"2017","unstructured":"Maximillian Nickel and Douwe Kiela. 2017. Poincar\u00e9 embeddings for learning hierarchical representations. NeurIPS, Vol. 30 (2017)."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i6.16616"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5984"},{"key":"e_1_3_2_2_23_1","volume-title":"The Societal Impacts of Algorithmic Decision-Making. Ph.,D. Dissertation","author":"Raghavan Manish","unstructured":"Manish Raghavan. 2021. The Societal Impacts of Algorithmic Decision-Making. Ph.,D. Dissertation. Cornell University."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Tahleen Rahman Bartlomiej Surma Michael Backes and Yang Zhang. 2019. Fairwalk: towards fair graph embedding. In IJCAI. 3289--3295.","DOI":"10.24963\/ijcai.2019\/456"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i11.17136"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371845"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-023-28874-9"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3570606"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3547353.3526951"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539346"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3341430"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3235312"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591674"},{"key":"e_1_3_2_2_34_1","volume-title":"Rethinking 1d-cnn for time series classification: A stronger baseline. arXiv preprint arXiv:2002.10061","author":"Tang Wensi","year":"2020","unstructured":"Wensi Tang, Guodong Long, Lu Liu, Tianyi Zhou, Jing Jiang, and Michael Blumenstein. 2020. Rethinking 1d-cnn for time series classification: A stronger baseline. arXiv preprint arXiv:2002.10061 (2020), 1--7."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Xianfeng Tang Huaxiu Yao Yiwei Sun Yiqi Wang Jiliang Tang Charu Aggarwal Prasenjit Mitra and Suhang Wang. 2020. Investigating and mitigating degree-related biases in graph convoltuional networks. In ACM CIKM. 1435--1444.","DOI":"10.1145\/3340531.3411872"},{"key":"e_1_3_2_2_36_1","volume-title":"International Conference on Learning Representations (ICLR).","author":"Tang Zeyu","year":"2023","unstructured":"Zeyu Tang, Yatong Chen, Yang Liu, and Kun Zhang. 2023. Tier Balancing: Towards Dynamic Fairness over Underlying Causal Factors. In International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_2_2_37_1","unstructured":"Petar Velivckovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph Attention Networks. In ICLR."},{"key":"e_1_3_2_2_38_1","volume-title":"Characterizing Long-Tail Categories on Graphs. arXiv preprint arXiv:2305.09938","author":"Wang Haohui","year":"2023","unstructured":"Haohui Wang, Baoyu Jing, Kaize Ding, Yada Zhu, and Dawei Zhou. 2023. Characterizing Long-Tail Categories on Graphs. arXiv preprint arXiv:2305.09938 (2023)."},{"key":"e_1_3_2_2_39_1","first-page":"32465","article-title":"Uncovering the Structural Fairness in Graph Contrastive Learning","volume":"35","author":"Wang Ruijia","year":"2022","unstructured":"Ruijia Wang, Xiao Wang, Chuan Shi, and Le Song. 2022. Uncovering the Structural Fairness in Graph Contrastive Learning. Advances in Neural Information Processing Systems, Vol. 35 (2022), 32465--32473.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3354077"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539404"},{"key":"e_1_3_2_2_42_1","volume-title":"Hierarchical Relational Learning for Few-Shot Knowledge Graph Completion. In The Eleventh International Conference on Learning Representations.","author":"Wu Han","year":"2022","unstructured":"Han Wu, Jie Yin, Bala Rajaratnam, and Jianyuan Guo. 2022. Hierarchical Relational Learning for Few-Shot Knowledge Graph Completion. In The Eleventh International Conference on Learning Representations."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3085504.3085526"},{"key":"e_1_3_2_2_44_1","first-page":"958","article-title":"Time-capturing dynamic graph embedding for temporal linkage evolution","volume":"35","author":"Yang Yu","year":"2021","unstructured":"Yu Yang, Jiannong Cao, Milos Stojmenovic, Senzhang Wang, Yiran Cheng, Chun Lum, and Zhetao Li. 2021. Time-capturing dynamic graph embedding for temporal linkage evolution. IEEE TKDE, Vol. 35, 1 (2021), 958--971.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_2_45_1","volume-title":"Xiaofang Zhou, and Lei Chen.","author":"Yang Yu","year":"2023","unstructured":"Yu Yang, Hongzhi Yin, Jiannong Cao, Tong Chen, Quoc Viet Hung Nguyen, Xiaofang Zhou, and Lei Chen. 2023. Time-aware dynamic graph embedding for asynchronous structural evolution. IEEE TKDE (2023)."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539300"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"crossref","unstructured":"Junliang Yu Hongzhi Yin Xin Xia Tong Chen Lizhen Cui and Quoc Viet Hung Nguyen. 2022. Are graph augmentations necessary? simple graph contrastive learning for recommendation. In ACM SIGIR. 1294--1303.","DOI":"10.1145\/3477495.3531937"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5698"},{"key":"e_1_3_2_2_49_1","first-page":"4741","article-title":"Dynamic graph neural networks for sequential recommendation","volume":"35","author":"Zhang Mengqi","year":"2022","unstructured":"Mengqi Zhang, Shu Wu, Xueli Yu, Qiang Liu, and Liang Wang. 2022. Dynamic graph neural networks for sequential recommendation. IEEE Transactions on Knowledge and Data Engineering, Vol. 35, 5 (2022), 4741--4753.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.09.059"},{"key":"e_1_3_2_2_51_1","volume-title":"International Conference on Machine Learning. PMLR, 12967--12978","author":"Zimmer Matthieu","year":"2021","unstructured":"Matthieu Zimmer, Claire Glanois, Umer Siddique, and Paul Weng. 2021. Learning fair policies in decentralized cooperative multi-agent reinforcement learning. In International Conference on Machine Learning. PMLR, 12967--12978."}],"event":{"name":"KDD '24: The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Barcelona Spain","acronym":"KDD '24","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671848","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3637528.3671848","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:04:14Z","timestamp":1750291454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671848"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,24]]},"references-count":51,"alternative-id":["10.1145\/3637528.3671848","10.1145\/3637528"],"URL":"https:\/\/doi.org\/10.1145\/3637528.3671848","relation":{},"subject":[],"published":{"date-parts":[[2024,8,24]]},"assertion":[{"value":"2024-08-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}