A Deep Latent Factor Graph Clustering with Fairness-Utility Trade-off Perspective
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913145581207552 |
|---|---|
| author | Ghodsi, Siamak Seyedi, Amjad Quy, Tai Le Karimi, Fariba Ntoutsi, Eirini |
| author_facet | Ghodsi, Siamak Seyedi, Amjad Quy, Tai Le Karimi, Fariba Ntoutsi, Eirini |
| contents | Fair graph clustering seeks partitions that respect network structure while maintaining proportional representation across sensitive groups, with applications spanning community detection, team formation, resource allocation, and social network analysis. Many existing approaches enforce rigid constraints or rely on multi-stage pipelines (e.g., spectral embedding followed by $k$-means), limiting trade-off control, interpretability, and scalability. We introduce \emph{DFNMF}, an end-to-end deep nonnegative tri-factorization tailored to graphs that directly optimizes cluster assignments with a soft statistical-parity regularizer. A single parameter $λ$ tunes the fairness--utility balance, while nonnegativity yields parts-based factors and transparent soft memberships. The optimization uses sparse-friendly alternating updates and scales near-linearly with the number of edges. Across synthetic and real networks, DFNMF achieves substantially higher group balance at comparable modularity, often dominating state-of-the-art baselines on the Pareto front. The code is available at https://github.com/SiamakGhodsi/DFNMF.git. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_23507 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Deep Latent Factor Graph Clustering with Fairness-Utility Trade-off Perspective Ghodsi, Siamak Seyedi, Amjad Quy, Tai Le Karimi, Fariba Ntoutsi, Eirini Machine Learning Artificial Intelligence Information Theory Fair graph clustering seeks partitions that respect network structure while maintaining proportional representation across sensitive groups, with applications spanning community detection, team formation, resource allocation, and social network analysis. Many existing approaches enforce rigid constraints or rely on multi-stage pipelines (e.g., spectral embedding followed by $k$-means), limiting trade-off control, interpretability, and scalability. We introduce \emph{DFNMF}, an end-to-end deep nonnegative tri-factorization tailored to graphs that directly optimizes cluster assignments with a soft statistical-parity regularizer. A single parameter $λ$ tunes the fairness--utility balance, while nonnegativity yields parts-based factors and transparent soft memberships. The optimization uses sparse-friendly alternating updates and scales near-linearly with the number of edges. Across synthetic and real networks, DFNMF achieves substantially higher group balance at comparable modularity, often dominating state-of-the-art baselines on the Pareto front. The code is available at https://github.com/SiamakGhodsi/DFNMF.git. |
| title | A Deep Latent Factor Graph Clustering with Fairness-Utility Trade-off Perspective |
| topic | Machine Learning Artificial Intelligence Information Theory |
| url | https://arxiv.org/abs/2510.23507 |