When recommending personalized top-$k$ items to users, how can we recommend the items diversely to them while satisfying their needs? Aggregately diversified recommender systems aim to recommend a variety of items across whole users without sacrificing the recommendation accuracy. They increase the exposure opportunities of various items, which in turn increase potential revenue of sellers as well as user satisfaction. However, it is challenging to tackle aggregate-level diversity with a matrix factorization (MF), one of the most common recommendation model, since skewed real world data lead to skewed recommendation results of MF. In this work, we propose DivMF (Diversely Regularized Matrix Factorization), a novel matrix factorization method for aggregately diversified recommendation. DivMF regularizes a score matrix of an MF model to maximize coverage and entropy of top-$k$ recommendation lists to aggregately diversify the recommendation results. We also propose an unmasking mechanism and carefully designed mi i-batch learning technique for accurate and efficient training. Extensive experiments on real-world datasets show that DivMF achieves the state-of-the-art performance in aggregately diversified recommendation.
翻译:在向用户推荐个性化最高价值项目时,我们如何在满足用户需求的同时向用户推荐不同项目? 整体多样化建议系统的目的是在不牺牲建议准确性的情况下,向整个用户推荐各种项目;它们增加了各种项目的接触机会,从而反过来增加卖方的潜在收入和用户满意度;然而,由于扭曲真实世界数据导致MF的建议结果偏差,因此,用最常用的建议模式之一矩阵化(MF)来处理总体多样性是困难的,因为扭曲真实世界数据会导致建议结果偏差。 在这项工作中,我们提议DivMF(不同常规化矩阵化),这是综合多样化建议的一种新的矩阵化方法。DivMF规范了一个MF模型的得分矩阵,以尽量扩大最高价值建议的覆盖面和增殖率,从而使建议结果总体多样化。我们还提议了一个松散机制,并仔细设计了用于准确和高效培训的i-batch学习技术。关于现实世界数据集的广泛实验显示DivMF在总体多样化建议中达到了最先进的业绩。