Addressing Shortcomings in Fair Graph Learning Datasets: Towards a New Benchmark

Author:

Qian Xiaowei1ORCID,Guo Zhimeng2ORCID,Li Jialiang3ORCID,Mao Haitao4ORCID,Li Bingheng4ORCID,Wang Suhang2ORCID,Ma Yao1ORCID

Affiliation:

1. Rensselaer Polytechnic Institute, Troy, NY, USA

2. The Pennsylvania State University, University Park, PA, USA

3. New Jersey Institute of Technology, Newark, NJ, USA

4. Michigan State University, East Lansing, MI, USA

Publisher

ACM

Reference34 articles.

1. Chirag Agarwal Himabindu Lakkaraju and Marinka Zitnik. 2021. Towards a Unified Framework for Fair and Stable Graph Representation Learning. arxiv: 2102.13186 [cs.LG]

2. Siddhant Arora. 2020. A survey on graph neural networks for knowledge graph completion. arXiv preprint arXiv:2007.12374 (2020).

3. Enyan Dai Limeng Cui Zhengyang Wang Xianfeng Tang Yinghan Wang Monica Cheng Bing Yin and Suhang Wang. 2023. A unified framework of graph information bottleneck for robustness and membership privacy. In KDD.

4. Say No to the Discrimination: Learning Fair Graph Neural Networks with Limited Sensitive Attribute Information

5. Enyan Dai, Tianxiang Zhao, Huaisheng Zhu, Junjie Xu, Zhimeng Guo, Hui Liu, Jiliang Tang, and Suhang Wang. [n.,d.]. A Comprehensive Survey on Trustworthy Graph Neural Networks: Privacy, Robustness, Fairness, and Explainability., Vol. 1, 1 ( [n.,d.]).

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3