arrow
返回

Fair Contrastive Learning on Graphs

delete2022-01-01
delete8
PRE
AI
Ö
Öykü Deniz Köse
Y
Yanning Shen *
DOI:10.1109/TSIPN.2022.3174953delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Node representation learning plays a critical role in learning over graphs. Specifically, the success of contrastive learning methods in unsupervised node representation learning has been demonstrated for various tasks, which has led to increase in attention towards the field. Despite the increasing popularity, fairness is widely under-explored in the area. Motivated by this, this study proposes novel fairness-aware graph augmentations based on adaptive feature masking and edge deletion, in order to mitigate the bias in graph contrastive learning. Different fairness notions on graphs are introduced in the study to guide the designs of the proposed adaptive augmentation schemes. Moreover, it is quantitatively shown that the proposed feature masking scheme can reduce the intrinsic bias. Experimental results on four real-world networks are presented to show that the introduced augmentation frameworks can improve group fairness measures together with comparable classification accuracy to state-of-the-art graph contrastive learning studies for node classification.
Keyword:
Machine learning on graphs
fairness
graph contrastive learning
data augmentation
node representation learning

期刊

IEEE Transactions on Signal and Information Processing over Networks 封面图
IEEE Transactions on Signal and Information Processing over Networks
IF:
4.9
论文数:
728
被引数:
1.9K

机构

University of California System 封面图
University of California System
学者数:
37.5W
论文数: 33.7W
被引数: 6.6K
引用论文

引用论文

Insurance activity and economic performance: Fresh evidence from asymmetric panel causality tests
err2018-10-24
err0
errOAAI
errAbdulnasser Hatemi‐J; Chi‐Chuan Lee; Chien‐Chiang Lee; Rangan Gupta
err分享
err收藏
Mossbauer study of an iron-chromium-carbon austenite
err1993-12-01
err0
PREAI
errC.G. Schon; H.R. Rechenberg; H. Goldenstein
err分享
err收藏
学者 查看更多内容