User-item matching for recommendation fairness
As we all know, users and item-providers are two main parties of participants in recommender systems. However, most existing research efforts on recommendation were focused on better serving users and overlooked the purpose of item-providers. This paper is devoted to improve the item exposure fairness for item-providers' objective, and keep the recommendation accuracy not decreased or even improved for users' objective. We propose to set stock volume constraints on items, to be specific, limit the maximally allowable recommended times of an item to be proportional to the frequency of its being interacted in the past, which is validated to achieve superior item exposure fairness to common recommenders and thus mitigates the Matthew Effect on item popularity. With the two constraints of pre-existing recommendation length of users and our stock volumes of items, a heuristic strategy based on normalized scores and a Minimum Cost Maximum Flow (MCMF) based model are proposed to solve the optimal user-item matching problem, whose accuracy performances are even better than that of baseline algorithm in regular recommendation context, and in line with state-of-the-art enhancement of the baseline. What's more, our MCMF based strategy is parameter-free, while those counterpart algorithms have to resort to parameter traversal process to achieve their best performance.
Code (0)
등록된 구현이 없습니다.
Tasks
Exposure FairnessFairnessRecommendation SystemsSimilar Papers 제목 키워드 기반
User-item fairness tradeoffs in recommendations
In the basic recommendation paradigm, the most (predicted) relevant item is recommended to each user. This may result in some items receiving lower exposure than they "should"; to counter this, several algorithmic approa…
FairnessRecommendation SystemsThe Unfairness of Active Users and Popularity Bias in Point-of-Interest Recommendation
Point-of-Interest (POI) recommender systems provide personalized recommendations to users and help businesses attract potential customers. Despite their success, recent studies suggest that highly data-driven recommendat…
FairnessRecommendation SystemsPotential Factors Leading to Popularity Unfairness in Recommender Systems: A User-Centered Analysis
Popularity bias is a well-known issue in recommender systems where few popular items are over-represented in the input data, while majority of other less popular items are under-represented. This disparate representation…
Movie RecommendationRecommendation SystemsFairSR: Fairness-aware Sequential Recommendation through Multi-Task Learning with Preference Graph Embeddings
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 prefere…
AttributeFairnessGraph EmbeddingMulti-Task Learning+1Proactive Guiding Strategy for Item-side Fairness in Interactive Recommendation
Item-side fairness is crucial for ensuring the fair exposure of long-tail items in interactive recommender systems. Existing approaches promote the exposure of long-tail items by directly incorporating them into recommen…
Hierarchical Reinforcement Learning