2022
DOI: 10.1145/3495163
|View full text |Cite
|
Sign up to set email alerts
|

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

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 article 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… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 27 publications
(5 citation statements)
references
References 44 publications
0
5
0
Order By: Relevance
“…Configurations. To assess group fairness (Section 4), we follow configurations from previous research [26,28]; the group of items is determined by their popularity (i.e., the number of purchases recorded in the historical baskets of the dataset). The top 20% of items with the highest purchase frequency as the popular group (𝐺 + ), while the remaining 80% of items are assigned to the unpopular group (𝐺 − ).…”
Section: Experiments 61 Experimental Setupmentioning
confidence: 99%
“…Configurations. To assess group fairness (Section 4), we follow configurations from previous research [26,28]; the group of items is determined by their popularity (i.e., the number of purchases recorded in the historical baskets of the dataset). The top 20% of items with the highest purchase frequency as the popular group (𝐺 + ), while the remaining 80% of items are assigned to the unpopular group (𝐺 − ).…”
Section: Experiments 61 Experimental Setupmentioning
confidence: 99%
“…Some recent studies have focused on disseminating multi-layered relational information within the knowledge graph to enhance recommendations. For instance, researchers have employed relation-aware graph neural networks [18,[22][23][24][25][31][32][33][34][35][36] to capture neighborhood features. RippleNet [18] naturally integrates the KGE method into the recommendation system through the preference propagation method, thus continuously and automatically excavating the user's potential hierarchical interest.…”
Section: Related Workmentioning
confidence: 99%
“…CKAN [24] tackles the cold start problem by using knowledgeaware collaborative networks to improve recommendation accuracy. FairSR [25] applies a fairness-aware preference graph embedding method to incorporate the knowledge of users' and items' attributes and their correlation into entity representations and alleviate the unfair distributions of user attributes on items. DFM-GCN [31] and DeepFM_GCN [32] employ the DeepFM and GCNs to learn the entity representation in the RS and the KGE, to excavate the semantic feature information between the two modules and improve the accuracy of recommendation.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations