Fair Graph Representation Learning with Imbalanced and Biased Data

Yu Wang
{"title":"Fair Graph Representation Learning with Imbalanced and Biased Data","authors":"Yu Wang","doi":"10.1145/3488560.3502218","DOIUrl":null,"url":null,"abstract":"Graph-structured data is omnipresent in various fields, such as biology, chemistry, social media and transportation. Learning informative graph representations are crucial in effectively completing downstream graph-related tasks such as node/graph classification and link prediction. Graph Neural Networks (GNNs), due to their inclusiveness on handling graph-structured data and distinguished data-mining power inherited from deep learning, have achieved significant success in learning graph representations. Nonetheless, most existing GNNs are mainly designed with unrealistic data assumptions, such as the balanced and unbiased data distributions while abounding real-world networks exhibit skewed (i.e., long-tailed) node/graph class distributions and may also encode patterns of previous discriminatory decisions dominated by sensitive attributes. Even further, extensive research efforts have been invested in developing GNN architectures towards improving model utility while most of the time totally ignoring whether the obtained node/graph representations conceal any discriminatory bias, which could lead to prejudicial decisions as GNN-based machine learning models are increasingly being utilized in real-world applications. In light of the prevalence of the above two types of unfairness originated from quantity-imbalanced and discriminatory bias, my research expects to propose novel node/graph representation learning frameworks through constructing innovative GNN architectures and devising novel graph-mining algorithms to learn both fair and expressive node/graph representations that can enjoy a favorable fairness-utility tradeoff.","PeriodicalId":348686,"journal":{"name":"Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3488560.3502218","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Graph-structured data is omnipresent in various fields, such as biology, chemistry, social media and transportation. Learning informative graph representations are crucial in effectively completing downstream graph-related tasks such as node/graph classification and link prediction. Graph Neural Networks (GNNs), due to their inclusiveness on handling graph-structured data and distinguished data-mining power inherited from deep learning, have achieved significant success in learning graph representations. Nonetheless, most existing GNNs are mainly designed with unrealistic data assumptions, such as the balanced and unbiased data distributions while abounding real-world networks exhibit skewed (i.e., long-tailed) node/graph class distributions and may also encode patterns of previous discriminatory decisions dominated by sensitive attributes. Even further, extensive research efforts have been invested in developing GNN architectures towards improving model utility while most of the time totally ignoring whether the obtained node/graph representations conceal any discriminatory bias, which could lead to prejudicial decisions as GNN-based machine learning models are increasingly being utilized in real-world applications. In light of the prevalence of the above two types of unfairness originated from quantity-imbalanced and discriminatory bias, my research expects to propose novel node/graph representation learning frameworks through constructing innovative GNN architectures and devising novel graph-mining algorithms to learn both fair and expressive node/graph representations that can enjoy a favorable fairness-utility tradeoff.
不平衡和有偏差数据下的公平图表示学习
图结构数据在生物、化学、社交媒体和交通等各个领域无处不在。学习信息图表示对于有效完成与图相关的下游任务(如节点/图分类和链接预测)至关重要。图神经网络(gnn)由于其处理图结构数据的包容性和继承自深度学习的卓越数据挖掘能力,在学习图表示方面取得了显著的成功。尽管如此,大多数现有的gnn主要是基于不现实的数据假设设计的,例如平衡和无偏数据分布,而大量的现实世界网络表现出倾斜(即长尾)节点/图类分布,并且还可能编码由敏感属性主导的先前歧视性决策的模式。此外,在开发GNN架构以提高模型效用方面已经投入了大量的研究工作,而大多数时候完全忽略了所获得的节点/图表示是否隐藏任何歧视性偏见,这可能导致偏见决策,因为基于GNN的机器学习模型越来越多地用于现实世界的应用。鉴于上述两种类型的不公平源于数量不平衡和歧视性偏见的普遍存在,我的研究希望通过构建创新的GNN架构和设计新的图挖掘算法来提出新的节点/图表示学习框架,以学习公平和富有表现力的节点/图表示,并享受良好的公平-效用权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信