Fairness amidst non‐IID graph data: A literature review
Wenbin Zhang, Shuigeng Zhou, Toby Walsh, Jeremy C. Weiss
Abstract
Abstract The growing importance of understanding and addressing algorithmic bias in artificial intelligence (AI) has led to a surge in research on AI fairness, which often assumes that the underlying data are independent and identically distributed (IID). However, real‐world data frequently exist in non‐IID graph structures that capture connections among individual units. To effectively mitigate bias in AI systems, it is essential to bridge the gap between traditional fairness literature, designed for IID data, and the prevalence of non‐IID graph data. This survey reviews recent advancements in fairness amidst non‐IID graph data, including the newly introduced fair graph generation and the commonly studied fair graph classification. In addition, available datasets and evaluation metrics for future research are identified, the limitations of existing work are highlighted, and promising future directions are proposed.