FairSR: Fairness-aware Sequential Recommendation through Multi-Task Learning with Preference Graph Embeddings

• URL: http://arxiv.org/abs/2205.00313v1
• Date: Sat, 30 Apr 2022 17:33:51 GMT
• Title: FairSR: Fairness-aware Sequential Recommendation through Multi-Task Learning with Preference Graph Embeddings
• Authors: Cheng-Te Li, Cheng Hsu, Yang Zhang
• Abstract summary: Sequential recommendation learns from the temporal dynamics of user-item interactions to predict the next ones. This paper aims at bringing a marriage between SR and algorithmic fairness. We propose a novel fairness-aware sequential recommendation task, in which a new metric, interaction fairness, is defined.
• Score: 14.543386085745192
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Sequential recommendation (SR) learns from the temporal dynamics of user-item interactions to predict the next ones. Fairness-aware recommendation mitigates a variety of algorithmic biases in the learning of user preferences. This paper aims at bringing a marriage between SR and algorithmic fairness. We propose a novel fairness-aware sequential recommendation task, in which a new metric, interaction fairness, is defined to estimate how recommended items are fairly interacted by users with different protected attribute groups. We propose a multi-task learning based deep end-to-end model, FairSR, which consists of two parts. One is to learn and distill personalized sequential features from the given user and her item sequence for SR. The other is fairness-aware preference graph embedding (FPGE). The aim of FPGE is two-fold: incorporating the knowledge of users' and items' attributes and their correlation into entity representations, and alleviating the unfair distributions of user attributes on items. Extensive experiments conducted on three datasets show FairSR can outperform state-of-the-art SR models in recommendation performance. In addition, the recommended items by FairSR also exhibit promising interaction fairness.

Related papers

• DifFaiRec: Generative Fair Recommender with Conditional Diffusion Model [22.653890395053207]
  We propose a novel recommendation algorithm named Diffusion-based Fair Recommender (DifFaiRec) to provide fair recommendations. DifFaiRec is built upon the conditional diffusion model and hence has a strong ability to learn the distribution of user preferences from their ratings on items. To guarantee fairness, we design a counterfactual module to reduce the model sensitivity to protected attributes and provide mathematical explanations.
  arXiv  Detail & Related papers  (2024-09-18T07:39:33Z)
• When Search Meets Recommendation: Learning Disentangled Search Representation for Recommendation [56.98380787425388]
  We propose a search-Enhanced framework for the Sequential Recommendation (SESRec) SESRec disentangling similar and dissimilar representations within S&R behaviors. Experiments on both industrial and public datasets demonstrate that SESRec consistently outperforms state-of-the-art models.
  arXiv  Detail & Related papers  (2023-05-18T09:04:50Z)
• Ordinal Graph Gamma Belief Network for Social Recommender Systems [54.9487910312535]
  We develop a hierarchical Bayesian model termed ordinal graph factor analysis (OGFA), which jointly models user-item and user-user interactions. OGFA not only achieves good recommendation performance, but also extracts interpretable latent factors corresponding to representative user preferences. We extend OGFA to ordinal graph gamma belief network, which is a multi-stochastic-layer deep probabilistic model.
  arXiv  Detail & Related papers  (2022-09-12T09:19:22Z)
• Intent Contrastive Learning for Sequential Recommendation [86.54439927038968]
  We introduce a latent variable to represent users' intents and learn the distribution function of the latent variable via clustering. We propose to leverage the learned intents into SR models via contrastive SSL, which maximizes the agreement between a view of sequence and its corresponding intent. Experiments conducted on four real-world datasets demonstrate the superiority of the proposed learning paradigm.
  arXiv  Detail & Related papers  (2022-02-05T09:24:13Z)
• Knowledge-Enhanced Hierarchical Graph Transformer Network for Multi-Behavior Recommendation [56.12499090935242]
  This work proposes a Knowledge-Enhanced Hierarchical Graph Transformer Network (KHGT) to investigate multi-typed interactive patterns between users and items in recommender systems. KHGT is built upon a graph-structured neural architecture to capture type-specific behavior characteristics. We show that KHGT consistently outperforms many state-of-the-art recommendation methods across various evaluation settings.
  arXiv  Detail & Related papers  (2021-10-08T09:44:00Z)
• Learning Dual Dynamic Representations on Time-Sliced User-Item Interaction Graphs for Sequential Recommendation [62.30552176649873]
  We devise a novel Dynamic Representation Learning model for Sequential Recommendation (DRL-SRe) To better model the user-item interactions for characterizing the dynamics from both sides, the proposed model builds a global user-item interaction graph for each time slice. To enable the model to capture fine-grained temporal information, we propose an auxiliary temporal prediction task over consecutive time slices.
  arXiv  Detail & Related papers  (2021-09-24T07:44:27Z)
• Attentive Social Recommendation: Towards User And Item Diversities [19.68134197265983]
  We propose an attentive social recommendation system (ASR) to address this issue. First, in ASR, Rec-conv graph network layers are proposed to extract the social factor, user-rating and item-rated factors. Second, a disentangling strategy is applied for diverse rating values.
  arXiv  Detail & Related papers  (2020-11-09T21:57:45Z)
• Incorporating User Micro-behaviors and Item Knowledge into Multi-task Learning for Session-based Recommendation [18.516121495514007]
  Session-based recommendation (SR) aims to predict the next interacted item based on a given session. Most existing SR models only focus on exploiting the consecutive items in a session interacted by a certain user. We propose a novel SR model MKM-SR, which incorporates user Micro-behaviors and item Knowledge into Multi-task learning for Session-based Recommendation.
  arXiv  Detail & Related papers  (2020-06-12T03:06:23Z)
• Joint Item Recommendation and Attribute Inference: An Adaptive Graph Convolutional Network Approach [61.2786065744784]
  In recommender systems, users and items are associated with attributes, and users show preferences to items. As annotating user (item) attributes is a labor intensive task, the attribute values are often incomplete with many missing attribute values. We propose an Adaptive Graph Convolutional Network (AGCN) approach for joint item recommendation and attribute inference.
  arXiv  Detail & Related papers  (2020-05-25T10:50:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.