Fairness in Graph Mining: A Survey
- URL: http://arxiv.org/abs/2204.09888v3
- Date: Tue, 11 Apr 2023 05:55:09 GMT
- Title: Fairness in Graph Mining: A Survey
- Authors: Yushun Dong, Jing Ma, Song Wang, Chen Chen, Jundong Li
- Abstract summary: Graph mining algorithms could lead to discrimination towards certain populations when exploited in human-centered applications.
We propose a novel taxonomy of fairness notions on graphs, which sheds light on their connections and differences.
We present an organized summary of existing techniques that promote fairness in graph mining.
- Score: 36.34373832850891
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Graph mining algorithms have been playing a significant role in myriad fields
over the years. However, despite their promising performance on various graph
analytical tasks, most of these algorithms lack fairness considerations. As a
consequence, they could lead to discrimination towards certain populations when
exploited in human-centered applications. Recently, algorithmic fairness has
been extensively studied in graph-based applications. In contrast to
algorithmic fairness on independent and identically distributed (i.i.d.) data,
fairness in graph mining has exclusive backgrounds, taxonomies, and fulfilling
techniques. In this survey, we provide a comprehensive and up-to-date
introduction of existing literature under the context of fair graph mining.
Specifically, we propose a novel taxonomy of fairness notions on graphs, which
sheds light on their connections and differences. We further present an
organized summary of existing techniques that promote fairness in graph mining.
Finally, we summarize the widely used datasets in this emerging research field
and provide insights on current research challenges and open questions, aiming
at encouraging cross-breeding ideas and further advances.
Related papers
- A Benchmark for Fairness-Aware Graph Learning [58.515305543487386]
We present an extensive benchmark on ten representative fairness-aware graph learning methods.
Our in-depth analysis reveals key insights into the strengths and limitations of existing methods.
arXiv Detail & Related papers (2024-07-16T18:43:43Z) - Few-Shot Learning on Graphs: from Meta-learning to Pre-training and
Prompting [56.25730255038747]
This survey endeavors to synthesize recent developments, provide comparative insights, and identify future directions.
We systematically categorize existing studies into three major families: meta-learning approaches, pre-training approaches, and hybrid approaches.
We analyze the relationships among these methods and compare their strengths and limitations.
arXiv Detail & Related papers (2024-02-02T14:32:42Z) - Graph Domain Adaptation: Challenges, Progress and Prospects [61.9048172631524]
We propose graph domain adaptation as an effective knowledge-transfer paradigm across graphs.
GDA introduces a bunch of task-related graphs as source graphs and adapts the knowledge learnt from source graphs to the target graphs.
We outline the research status and challenges, propose a taxonomy, introduce the details of representative works, and discuss the prospects.
arXiv Detail & Related papers (2024-02-01T02:44:32Z) - Graph Fairness Learning under Distribution Shifts [33.9878682279549]
Graph neural networks (GNNs) have achieved remarkable performance on graph-structured data.
GNNs may inherit prejudice from the training data and make discriminatory predictions based on sensitive attributes, such as gender and race.
We propose a graph generator to produce numerous graphs with significant bias and under different distances.
arXiv Detail & Related papers (2024-01-30T06:51:24Z) - A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation [21.76051896779245]
We aim to provide a comprehensive understanding of graph reduction methods, including graph sparsification, graph coarsening, and graph condensation.
Our survey then systematically reviews the technical details of these methods and emphasizes their practical applications across diverse scenarios.
arXiv Detail & Related papers (2024-01-29T01:19:09Z) - A Survey of Imbalanced Learning on Graphs: Problems, Techniques, and
Future Directions [64.84521350148513]
Graphs represent interconnected structures prevalent in a myriad of real-world scenarios.
Effective graph analytics, such as graph learning methods, enables users to gain profound insights from graph data.
However, these methods often suffer from data imbalance, a common issue in graph data where certain segments possess abundant data while others are scarce.
This necessitates the emerging field of imbalanced learning on graphs, which aims to correct these data distribution skews for more accurate and representative learning outcomes.
arXiv Detail & Related papers (2023-08-26T09:11:44Z) - BiaScope: Visual Unfairness Diagnosis for Graph Embeddings [8.442750346008431]
We present BiaScope, an interactive visualization tool that supports end-to-end visual unfairness diagnosis for graph embeddings.
It allows the user to (i.e. visually compare two embeddings with respect to fairness, (ii) locate nodes or graph communities that are unfairly embedded, and (iii) understand the source of bias by interactively linking the relevant embedding subspace with the corresponding graph topology.
arXiv Detail & Related papers (2022-10-12T17:12:19Z) - A Survey on Fairness for Machine Learning on Graphs [2.3326951882644553]
This survey is the first one dedicated to fairness for relational data.
It aims to present a comprehensive review of state-of-the-art techniques in fairness on graph mining.
arXiv Detail & Related papers (2022-05-11T10:40:56Z) - Unbiased Graph Embedding with Biased Graph Observations [52.82841737832561]
We propose a principled new way for obtaining unbiased representations by learning from an underlying bias-free graph.
Based on this new perspective, we propose two complementary methods for uncovering such an underlying graph.
arXiv Detail & Related papers (2021-10-26T18:44:37Z) - Biased Edge Dropout for Enhancing Fairness in Graph Representation
Learning [14.664485680918725]
We propose a biased edge dropout algorithm (FairDrop) to counter-act homophily and improve fairness in graph representation learning.
FairDrop can be plugged in easily on many existing algorithms, is efficient, adaptable, and can be combined with other fairness-inducing solutions.
We prove that the proposed algorithm can successfully improve the fairness of all models up to a small or negligible drop in accuracy.
arXiv Detail & Related papers (2021-04-29T08:59:36Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.