Toward Structure Fairness in Dynamic Graph Embedding: A Trend-aware Dual Debiasing Approach
Yicong Li, Yu Yang, Jiannong Cao, Shuaiqi Liu, Haoran Tang, Guandong, Xu

TL;DR
This paper introduces FairDGE, a novel dynamic graph embedding method that enhances structural fairness by jointly modeling vertex connection changes and degree evolution, addressing fairness issues in dynamic graphs.
Contribution
It proposes the first structurally fair dynamic graph embedding algorithm with a dual debiasing approach that improves both effectiveness and fairness.
Findings
FairDGE outperforms existing methods in fairness metrics.
It maintains high embedding effectiveness while improving fairness.
Extensive experiments validate the approach's superiority.
Abstract
Recent studies successfully learned static graph embeddings that are structurally fair by preventing the effectiveness disparity of high- and low-degree vertex groups in downstream graph mining tasks. However, achieving structure fairness in dynamic graph embedding remains an open problem. Neglecting degree changes in dynamic graphs will significantly impair embedding effectiveness without notably improving structure fairness. This is because the embedding performance of high-degree and low-to-high-degree vertices will significantly drop close to the generally poorer embedding performance of most slightly changed vertices in the long-tail part of the power-law distribution. We first identify biased structural evolutions in a dynamic graph based on the evolving trend of vertex degree and then propose FairDGE, the first structurally Fair Dynamic Graph Embedding algorithm. FairDGE learns…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks
