Towards Cohesion-Fairness Harmony: Contrastive Regularization in Individual Fair Graph Clustering
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910334172790784 |
|---|---|
| author | Ghodsi, Siamak Seyedi, Seyed Amjad Ntoutsi, Eirini |
| author_facet | Ghodsi, Siamak Seyedi, Seyed Amjad Ntoutsi, Eirini |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_10756 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Towards Cohesion-Fairness Harmony: Contrastive Regularization in Individual Fair Graph Clustering Ghodsi, Siamak Seyedi, Seyed Amjad Ntoutsi, Eirini Machine Learning Artificial Intelligence Information Theory Social and Information Networks 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. |
| title | Towards Cohesion-Fairness Harmony: Contrastive Regularization in Individual Fair Graph Clustering |
| topic | Machine Learning Artificial Intelligence Information Theory Social and Information Networks |
| url | https://arxiv.org/abs/2402.10756 |