论文标题
SPR：根据先验知识进行监督的个性化排名
SPR:Supervised Personalized Ranking Based on Prior Knowledge for Recommendation
论文作者
论文摘要
推荐系统的目的是通过用户项目的交互历史记录对每个用户和每个项目之间的相关性进行建模，以便最大程度地提高样本得分并最大程度地减少负面样本。当前，两个流行的损失功能被广泛用于优化推荐系统：PointSise和成对。尽管这些损失功能被广泛使用，但是有两个问题。 （1）这些传统损失功能不符合推荐系统的目标，并充分利用了先验知识信息。 （2）这些传统损失功能的缓慢收敛速度使各种建议模型的实际应用变得困难。 为了解决这些问题，我们根据先验知识提出了一个新颖的损失函数，名为“监督个性化排名”（SPR）。提出的方法通过利用原始数据中每个用户或项目的相互作用历史记录的先验知识来改善BPR损失。与BPR不同，而不是构建<用户，正面项目，负面项目>三元组，而是拟议的SPR构造<用户，相似的用户，正面项目，负项目>四倍体。尽管SPR非常简单，但非常有效。广泛的实验表明，我们提出的SPR不仅取得了更好的建议性能，而且还可以显着加速收敛速度，从而大大减少所需的训练时间。
The goal of a recommendation system is to model the relevance between each user and each item through the user-item interaction history, so that maximize the positive samples score and minimize negative samples. Currently, two popular loss functions are widely used to optimize recommender systems: the pointwise and the pairwise. Although these loss functions are widely used, however, there are two problems. (1) These traditional loss functions do not fit the goals of recommendation systems adequately and utilize prior knowledge information sufficiently. (2) The slow convergence speed of these traditional loss functions makes the practical application of various recommendation models difficult. To address these issues, we propose a novel loss function named Supervised Personalized Ranking (SPR) Based on Prior Knowledge. The proposed method improves the BPR loss by exploiting the prior knowledge on the interaction history of each user or item in the raw data. Unlike BPR, instead of constructing <user, positive item, negative item> triples, the proposed SPR constructs <user, similar user, positive item, negative item> quadruples. Although SPR is very simple, it is very effective. Extensive experiments show that our proposed SPR not only achieves better recommendation performance, but also significantly accelerates the convergence speed, resulting in a significant reduction in the required training time.
