论文标题
公平的多利益相关者新闻推荐系统具有HyperGraph排名
Fair Multi-Stakeholder News Recommender System with Hypergraph ranking
论文作者
论文摘要
推荐系统通常旨在满足最终用户需求。但是,在某些域中,用户并不是系统中唯一的利益相关者。例如,在新闻汇总者网站用户中,作者,杂志以及平台本身都是潜在的利益相关者。大多数协作过滤推荐系统都有受欢迎的偏见。因此,如果推荐系统仅考虑用户的偏好,则大概它过高的占人群受欢迎的提供商和不足的代表人数不太受欢迎。为了解决这个问题,应该考虑生成的排名列表中的其他利益相关者。在本文中,我们证明了HyperGraph学习具有处理多方面推荐任务的自然能力。超图可以对不同类型的对象之间的高阶关系建模,因此自然倾向于生成考虑多个利益相关者的建议列表。我们在时间上构成建议,并学会适应利益相关者的权重,以增加较低覆盖的利益相关者的覆盖范围。结果表明,所提出的方法反驳了受欢迎程度的偏见,并针对两个新闻数据集的作者提出了更公平的建议,精确的成本低。
Recommender systems are typically designed to fulfill end user needs. However, in some domains the users are not the only stakeholders in the system. For instance, in a news aggregator website users, authors, magazines as well as the platform itself are potential stakeholders. Most of the collaborative filtering recommender systems suffer from popularity bias. Therefore, if the recommender system only considers users' preferences, presumably it over-represents popular providers and under-represents less popular providers. To address this issue one should consider other stakeholders in the generated ranked lists. In this paper we demonstrate that hypergraph learning has the natural capability of handling a multi-stakeholder recommendation task. A hypergraph can model high order relations between different types of objects and therefore is naturally inclined to generate recommendation lists considering multiple stakeholders. We form the recommendations in time-wise rounds and learn to adapt the weights of stakeholders to increase the coverage of low-covered stakeholders over time. The results show that the proposed approach counters popularity bias and produces fairer recommendations with respect to authors in two news datasets, at a low cost in precision.