Table of Contents
Fetching ...

Towards Cohesion-Fairness Harmony: Contrastive Regularization in Individual Fair Graph Clustering

Siamak Ghodsi, Seyed Amjad Seyedi, Eirini Ntoutsi

TL;DR

The paper tackles fairness in unsupervised graph clustering by introducing iFairNMTF, a Fairness-aware Symmetric Nonnegative Matrix Tri-Factorization that incorporates a contrastive regularization term to enforce individual fairness while preserving cluster cohesion. It employs a joint objective $\min_{\bm{H},\bm{W}\ge 0} \lVert\bm{A}-\bm{H}\bm{W}\bm{H}^T\rVert^2_F + \lambda\,\text{Tr}(\bm{H}^T\bm{L}\bm{H})$, where $\bm{L}$ encodes contrastive relations between demographic groups, and updates are performed via multiplicative rules for $\bm{H}$ and $\bm{W}$. Key contributions include: (i) a flexible framework with an adjustable fairness parameter $\lambda$; (ii) a novel contrastive regularization promoting cross-group diversity within clusters; (iii) retention of interpretability through nonnegativity and an explicit cluster-interaction matrix $\bm{W}$; (iv) extensive experiments on real and synthetic data showing improved fairness (balance $B$) without sacrificing clustering quality (modularity $Q$). The approach provides practical, white-box control over fairness-cohesion trade-offs and offers interpretable insights into inter-cluster relationships, with potential impact on fair clustering in networked systems and beyond.

Abstract

Conventional fair graph clustering methods face two primary challenges: i) They prioritize balanced clusters at the expense of cluster cohesion by imposing rigid constraints, ii) Existing methods of both individual and group-level fairness in graph partitioning mostly rely on eigen decompositions and thus, generally lack interpretability. To address these issues, we propose iFairNMTF, an individual Fairness Nonnegative Matrix Tri-Factorization model with contrastive fairness regularization that achieves balanced and cohesive clusters. By introducing fairness regularization, our model allows for customizable accuracy-fairness trade-offs, thereby enhancing user autonomy without compromising the interpretability provided by nonnegative matrix tri-factorization. Experimental evaluations on real and synthetic datasets demonstrate the superior flexibility of iFairNMTF in achieving fairness and clustering performance.

Towards Cohesion-Fairness Harmony: Contrastive Regularization in Individual Fair Graph Clustering

TL;DR

The paper tackles fairness in unsupervised graph clustering by introducing iFairNMTF, a Fairness-aware Symmetric Nonnegative Matrix Tri-Factorization that incorporates a contrastive regularization term to enforce individual fairness while preserving cluster cohesion. It employs a joint objective , where encodes contrastive relations between demographic groups, and updates are performed via multiplicative rules for and . Key contributions include: (i) a flexible framework with an adjustable fairness parameter ; (ii) a novel contrastive regularization promoting cross-group diversity within clusters; (iii) retention of interpretability through nonnegativity and an explicit cluster-interaction matrix ; (iv) extensive experiments on real and synthetic data showing improved fairness (balance ) without sacrificing clustering quality (modularity ). The approach provides practical, white-box control over fairness-cohesion trade-offs and offers interpretable insights into inter-cluster relationships, with potential impact on fair clustering in networked systems and beyond.

Abstract

Conventional fair graph clustering methods face two primary challenges: i) They prioritize balanced clusters at the expense of cluster cohesion by imposing rigid constraints, ii) Existing methods of both individual and group-level fairness in graph partitioning mostly rely on eigen decompositions and thus, generally lack interpretability. To address these issues, we propose iFairNMTF, an individual Fairness Nonnegative Matrix Tri-Factorization model with contrastive fairness regularization that achieves balanced and cohesive clusters. By introducing fairness regularization, our model allows for customizable accuracy-fairness trade-offs, thereby enhancing user autonomy without compromising the interpretability provided by nonnegative matrix tri-factorization. Experimental evaluations on real and synthetic datasets demonstrate the superior flexibility of iFairNMTF in achieving fairness and clustering performance.
Paper Structure (15 sections, 18 equations, 4 figures, 1 table, 1 algorithm)

This paper contains 15 sections, 18 equations, 4 figures, 1 table, 1 algorithm.

Figures (4)

  • Figure 1: Schematic representation of the iFairNMTF model with contrastive regularization.
  • Figure 2: Performance comparison w.r.t. clustering quality/modularity $Q$ and cluster fairness $B$ (higher values are better for both measures) on DrugNet, and LastFM for different number of clusters $k\in [2,10]$. $k=10$ is the convergence point of all models.
  • Figure 3: Parameter $\lambda$ analysis of the iFairNMTF on Drugnet and LastFM-Net datasets with k = 5 in terms of Q and B for $\lambda\in [0,100]$. Solid lines depict modularity and dashed lines represent balance. Only the behavior of FairSNMF depends on $\lambda$.
  • Figure 4: Interpretability of $\bm{W}$ factor for a 40-node graph divided to 4 clusters. Shapes indicate groups.