Towards Cohesion-Fairness Harmony: Contrastive Regularization in Individual Fair Graph Clustering
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Tri-Learn Graph Fusion Network for Attributed Graph Clustering
Towards Fair Representation: Clustering and Consensus
Accelerating Spectral Clustering under Fairness Constraints
When Fairness Isn't Statistical: The Limits of Machine Learning in Evaluating Legal Reasoning
A Computational Approach to Improving Fairness in K-means Clustering
Optimizing Connectivity and Scheduling of Near/Far Field Users in Massive MIMO NOMA System
토론
이 논문과 연결된 포럼 글이 아직 없습니다.