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

February 16, 2024 ยท Declared Dead ยท ๐Ÿ› Pacific-Asia Conference on Knowledge Discovery and Data Mining

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Siamak Ghodsi, Seyed Amjad Seyedi, Eirini Ntoutsi arXiv ID 2402.10756 Category cs.LG: Machine Learning Cross-listed cs.AI, cs.IT, cs.SI Citations 11 Venue Pacific-Asia Conference on Knowledge Discovery and Data Mining Last Checked 3 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning

Died the same way โ€” ๐Ÿ‘ป Ghosted