论文标题
多元正规化的矩阵分解,以准确且汇总多样化的建议
Diversely Regularized Matrix Factorization for Accurate and Aggregately Diversified Recommendation
论文作者
论文摘要
当向用户推荐个性化的顶级$ K $项目时,我们如何在满足其需求的同时向它们推荐这些物品?总体多元化的推荐系统的目的是在不牺牲建议准确性的情况下推荐各种用户的各种项目。它们增加了各种项目的接触机会,从而增加了卖方的潜在收入以及用户满意度。但是,以矩阵分解(MF)来解决总体多样性(最常见的推荐模型之一),这是一个挑战,因为偏向现实世界的数据导致MF的建议结果偏斜。在这项工作中,我们提出了DIVMF(多样化的矩阵分解),这是一种用于综合多元化建议的新型矩阵分解方法。 DivMF将MF模型的得分矩阵定期化,以最大程度地提高覆盖范围和顶部$ K $建议列表,以汇总推荐结果多样化。我们还提出了一种揭露机制,并精心设计的MI I块学习技术,以进行准确有效的培训。对现实世界数据集的广泛实验表明,DivMF在总体多元化的建议中实现了最先进的性能。
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.