Skip to main content

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

  • Conference paper
  • First Online:
Advances in Knowledge Discovery and Data Mining (PAKDD 2024)

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 74.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Link to supplemental file and source codes: Github.com/SiamakGhodsi/iFairNMTF.

References

  1. Abdollahi, R., AmjadĀ Seyedi, S., RezaĀ Noorimehr, M.: Asymmetric semi-nonnegative matrix factorization for directed graph clustering. In: ICCKE, pp. 323ā€“328 (2020)

    Google ScholarĀ 

  2. Chakraborty, T., Dalmia, A., Mukherjee, A., Ganguly, N.: Metrics for community analysis: A survey. ACM Comput. Surv. 50(4), 1ā€“37 (2017)

    ArticleĀ  Google ScholarĀ 

  3. Chierichetti, F., Kumar, R., Lattanzi, S., Vassilvitskii, S.: Fair clustering through fairlets. In: Advances in NeurIPS, pp. 5029ā€“5037 (2017)

    Google ScholarĀ 

  4. Dai, E., Wang, S.: Say no to the discrimination: learning fair graph neural networks with limited sensitive attribute information. In: WSDM, pp. 680ā€“688 (2021)

    Google ScholarĀ 

  5. Dong, Y., Kang, J., Tong, H., Li, J.: Individual fairness for graph neural networks: a ranking based approach. In: KDD, pp. 300ā€“310. ACM (2021)

    Google ScholarĀ 

  6. Dong, Y., Ma, J., Wang, S., Chen, C., Li, J.: Fairness in graph mining: a survey. IEEE Transactions on Knowledge and Data Engineering, pp. 1ā€“22 (2023)

    Google ScholarĀ 

  7. Dwork, C., Hardt, M., Pitassi, T., Reingold, O., Zemel, R.S.: Fairness through awareness. In: Proceedings of the 3rd ITCS Conference, pp. 214ā€“226 (2012)

    Google ScholarĀ 

  8. Ghodsi, S., Ntoutsi, E.: Affinity clustering framework for data debiasing using pairwise distribution discrepancy. In: EWAF. CEUR Proceedings, vol.Ā 3442 (2023)

    Google ScholarĀ 

  9. Gupta, S., Dukkipati, A.: Protecting individual interests across clusters: Spectral clustering with guarantees. CoRR abs/2105.03714 (2021)

    Google ScholarĀ 

  10. Gupta, S., Dukkipati, A.: Consistency of constrained spectral clustering under graph induced fair planted partitions. In: Advances in NeurIPS, pp. 13527ā€“13540 (2022)

    Google ScholarĀ 

  11. Hajiveiseh, A., Seyedi, S.A., Tab, F.A.: Deep asymmetric nonnegative matrix factorization for graph clustering. Pattern Recognit. 148, 110179 (2024)

    ArticleĀ  Google ScholarĀ 

  12. Kang, J., He, J., Maciejewski, R., Tong, H.: Inform: individual fairness on graph mining. In: KDD, pp. 379ā€“389. ACM (2020)

    Google ScholarĀ 

  13. Kleindessner, M., Samadi, S., Awasthi, P., Morgenstern, J.: Guarantees for spectral clustering with fairness constraints. In: ICML, vol.Ā 97, pp. 3458ā€“3467 (2019)

    Google ScholarĀ 

  14. Kuang, D., Park, H., Ding, C.H.Q.: Symmetric nonnegative matrix factorization for graph clustering. In: SDM, pp. 106ā€“117 (2012)

    Google ScholarĀ 

  15. Lahoti, P., Gummadi, K.P., Weikum, G.: Operationalizing individual fairness with pairwise fair representations. Proc. VLDB Endow. 13(4), 506ā€“518 (2019)

    ArticleĀ  Google ScholarĀ 

  16. Li, T., Ding, C.c.: Nonnegative matrix factorizations for clustering: a survey. In: Data Clustering, pp. 149ā€“176. Chapman and Hall/CRC (2018)

    Google ScholarĀ 

  17. von Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395ā€“416 (2007)

    ArticleĀ  MathSciNetĀ  Google ScholarĀ 

  18. Mastrandrea, R., Fournet, J., Barrat, A.: Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys. PLoS ONE 10(9), e0136497 (2015)

    ArticleĀ  Google ScholarĀ 

  19. Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103(23), 8577ā€“8582 (2006)

    Google ScholarĀ 

  20. Ntoutsi, E., et al.: Bias in data-driven artificial intelligence systems-an introductory survey. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery 10(3), e1356 (2020)

    Google ScholarĀ 

  21. Pei, Y., Chakraborty, N., Sycara, K.P.: Nonnegative matrix tri-factorization with graph regularization for community detection in social networks. In: IJCAI, pp. 2083ā€“2089. AAAI Press (2015)

    Google ScholarĀ 

  22. Quy, T.L., Friege, G., Ntoutsi, E.: Multi-fair capacitated students-topics grouping problem. In: PAKDD (1). LNCS, vol. 13935, pp. 507ā€“519. Springer (2023)

    Google ScholarĀ 

  23. Roy, A., Horstmann, J., Ntoutsi, E.: Multi-dimensional discrimination in law and machine learning - A comparative overview. In: FAccT. pp. 89ā€“100. ACM (2023)

    Google ScholarĀ 

  24. Rozemberczki, B., Sarkar, R.: Characteristic functions on graphs: Birds of a feather, from statistical descriptors to parametric models. In: CIKM, pp. 1325ā€“1334 (2020)

    Google ScholarĀ 

  25. Tsitsulin, A., Palowitch, J., Perozzi, B., MĆ¼ller, E.: Graph clustering with graph neural networks. J. Mach. Learn. Res. 24, 127:1ā€“127:21 (2023)

    Google ScholarĀ 

  26. Wang, J., Lu, D., Davidson, I., Bai, Z.: Scalable spectral clustering with group fairness constraints. In: AISTATS, pp. 6613ā€“6629 (2023)

    Google ScholarĀ 

  27. Wang, Y., Kang, J., Xia, Y., Luo, J., Tong, H.: ifig: Individually fair multi-view graph clustering. In: IEEE Big Data, pp. 329ā€“338. IEEE (2022)

    Google ScholarĀ 

  28. Weeks, M.R., Clair, S., Borgatti, S.P., Radda, K., Schensul, J.J.: Social networks of drug users in high-risk sites: finding the connections. AIDS Behav. 6, 193ā€“206 (2002)

    ArticleĀ  Google ScholarĀ 

  29. Zemel, R.S., Wu, Y., Swersky, K., Pitassi, T., Dwork, C.: Learning fair representations. In: ICML (3). JMLR Workshop and Conference Proceedings, vol.Ā 28, pp. 325ā€“333. JMLR.org (2013)

    Google ScholarĀ 

Download references

Acknowledgements

This work has received funding from the European Unionā€™s Horizon 2020 research and innovation programme under Marie Sklodowska-Curie Actions (grant agreement number 860630) for the project ā€œNoBIAS - Artificial Intelligence without Biasā€. This work reflects only the authorsā€™ views and the European Research Executive Agency (REA) is not responsible for any use that may be made of the information it contains. The research was also supported by the EU Horizon Europe project MAMMOth (GrantAgreement 101070285).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Siamak Ghodsi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ghodsi, S., Seyedi, S.A., Ntoutsi, E. (2024). Towards Cohesion-Fairness Harmony: Contrastive Regularization inĀ Individual Fair Graph Clustering. In: Yang, DN., Xie, X., Tseng, V.S., Pei, J., Huang, JW., Lin, J.CW. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2024. Lecture Notes in Computer Science(), vol 14645. Springer, Singapore. https://doi.org/10.1007/978-981-97-2242-6_23

Download citation

  • DOI: https://doi.org/10.1007/978-981-97-2242-6_23

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-97-2241-9

  • Online ISBN: 978-981-97-2242-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics