论文标题
用户项目匹配以进行建议公平
User-item matching for recommendation fairness
论文作者
论文摘要
众所周知,用户和项目支持者是推荐系统参与者的两个主要派对。但是,大多数有关推荐的研究工作都集中在更好地为用户服务上,并忽略了项目支持者的目的。本文致力于改善物品支持者目标的物品曝光公平性,并保持建议准确性不会降低甚至可以改善用户目标。我们建议在项目上设置库存数量限制,以限制与过去相互作用的频率成比例的最大允许的建议时间,这将经过验证,以使Matthew效应对商品的效果降低普通推荐人的优越性。提出,提出了基于标准化分数的启发式策略的两个限制,提出了一种基于标准化的启发式策略和基于最低成本的最高流量(MCMF)模型来解决最佳的用户项目匹配问题,其准确性表现甚至比常规推荐上下文中的基线algorithm更好,而与国家 /地区的基础上的基础相同。更重要的是,我们的基于MCMF的策略是无参数的,而这些对应算法必须求助于参数遍历过程才能达到最佳性能。
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.