Co-clustering for fair recommendation - Archive ouverte HAL Access content directly
Conference Papers Year :

Co-clustering for fair recommendation


Collaborative filtering relies on a sparse rating matrix, where each user rates a few products, to propose recommendations. The approach consists to approximate the sparse rating matrix with a simple model whose regularities allow to fill in the missing entries. The latent block model is a generative co-clustering model that can provide such an approximation. In this paper, we show that exogenous sensitive attributes can be incorporated in this model to ensure fair recommendations. Since users are only characterized by their ratings and their sensitive attribute, fairness is measured here by a parity criterion. Introducing the sensitive attribute in the latent block model leads to a classification of users that is independent from the sensitive attribute. We propose a definition of fairness for the recommender system that expresses that the ranking of items should be independent of the sensitive attribute. We show that our model ensures approximately fair recommendations provided that the classification of users approximately respects statistical parity.
Fichier principal
Vignette du fichier
fair_coclust.pdf (651.6 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03239856 , version 1 (27-05-2021)



Gabriel Frisch, Jean-Benoist Leger, Yves Grandvalet. Co-clustering for fair recommendation. 21st European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2021), Sep 2021, Bilbao, Spain. pp.607-630, ⟨10.1007/978-3-030-93736-2_44⟩. ⟨hal-03239856v1⟩
157 View
305 Download



Gmail Facebook Twitter LinkedIn More