隐式反馈_隐式反馈的推荐系统贝叶斯个性化排名

隐式反馈

It’s more prevalent to see the companies use the recommended system algorithm to produce users’ favorite items based on the previous shopping experience. Online customers would get recommended items while shopping online from stores like eBay, Amazon, Walmart, etc. The article is focused on item recommendations. The item recommendation system method provides a user-specific ranking for a set of items learned from users’ past datasets such as buying history, viewing history, etc. Nowadays, the recommendation system varies a lot from the input of explicit dataset like ratings to an implicit dataset such as monitoring clicks, view times, purchases, etc. This information is easier to collect, but hard to recommend the users’ favorite items.

看到公司使用推荐的系统算法根据以前的购物经验来生产用户喜欢的商品的情况更为普遍。 在线顾客在从eBay，Amazon，Walmart等商店在线购物时将获得推荐商品。本文重点介绍商品推荐。 物品推荐系统方法为从用户过去的数据集(例如购买历史记录，观看历史记录等)中学习到的一组物品提供了特定于用户的排名。如今，推荐系统的变化范围很大，从像评级这样的显式数据集到隐式数据集，例如监视点击次数，查看时间，购买次数等。此信息更易于收集，但难以推荐用户喜欢的项目。

In this article, you will learn the singular value decomposition and truncated SVD of the recommender system:

在本文中，您将学习推荐系统的奇异值分解和截断SVD：

(1) Personalized Ranking System

(1)个性化排名系统

(2) Problem Statement

(2)问题陈述

(3) Bayesian Personalized Ranking (BPR)

(3)贝叶斯个性化排名(BPR)

(4) BPR Optimization Criterion

(4)BPR优化准则

(5) BPR Learning Algorithm

(5)BPR学习算法

(6) Matrix Factorization

(6)矩阵分解

(7) Adaptive K-nearest-neighbor

(7)自适应K近邻

个性化排名系统 (Personalized Ranking System)

The personalized ranking provides customers with item recommendations of a ranked list of items. The article would focus on recommending customers with a personalized ranked list of items from users’ implicit behavior derived from the past purchase data. Observed from the purchase data, it is available to get the positive observations like users’ bought history, whereas non-observed user-item pairs data is difficult for the model input like the unbought item, non-interested items, or the interesting items for their future purchase.

个性化排名为客户提供了项目排名列表的项目推荐。 本文将重点介绍从过去购买数据得出的用户隐式行为中，推荐具有个性化商品排名列表的客户。 从购买数据中观察，可以得到诸如用户的购买历史之类的正面观察，而对于模型输入(如未购买的商品，不感兴趣的商品或感兴趣的商品)，很难观察到用户-商品对数据。他们未来的购买。

问题陈述 (Problem Statement)

For the implicit feedback systems, it is able to detect the positive dataset like bought history. For the remaining data, it is a mixture of actually negative and missing values. Nevertheless, machine learning models are unable to learn the missing data. Typically, the item recommenders output the personalized score X_ui based on the preference of the user for the item, and items are sorted form the predicted score. The machine learning model of item recommenders provides the training data with giving pairs (u, i) ∈ S as a positive class label and all other combinations in (U × I) \ S a negative one.

对于隐式反馈系统，它能够检测到像购买历史记录这样的正数据集。 对于其余数据，它实际上是负值和缺失值的混合。 然而，机器学习模型无法学习丢失的数据。 通常，项目推荐者基于用户对项目的偏好来输出个性化得分X_ui，并且将项目从预测得分中分类。 项目推荐者的机器学习模型为训练数据提供(u，i)∈S对作为正类别标签，而(U×I)\ S中的所有其他组合为负数对。

The model is fit to predict the positive class with value 1 and 0 for the rest. The problem would occur when the model is unable to rank the items ((U × I) \ S), which have been given as negative feedback during the training. An alternative would be to add regularization to the model to prevent overfitting. Another method is to create item pairs as training data and optimize for correctly ranking item pairs instead of scoring single item while the missing values are taken care of. From the photo below, it’s hard for the model to only learn from the observed data. Therefore, all the negative data is replaced with 0.

该模型适合于预测阳性类别，其余类别的值为1和0。 当模型无法对在训练过程中作为负面反馈给出的项目((U×I)\ S)进行排名时，将出现问题。 另一种选择是向模型添加正则化以防止过度拟合。 另一种方法是将物料对创建为训练数据，并针对物料对正确排序进行优化，而不是在照顾缺失值的同时对单个物料评分。 从下面的照片中，模型很难仅从观察到的数据中学习。 因此，所有负数据都将替换为0。

Photo0: The observed 0 value and unobserved 1 value.

Photo0：观察到的0值和未观察到的1值。

贝叶斯个性化排名(BPR) (Bayesian Personalized Ranking (BPR))

To overcome the personalized ranking task, the Bayesian personalized ranking incorporates the Bayesian analysis of the problem using the likelihood function for p(i >u j|Θ) and the prior probability for the model parameter p(Θ).

为了克服个性化排名任务，贝叶斯个性化排名使用针对p(i> uj |Θ)的似然函数和模型参数p(Θ)的先验概率，对问题进行了贝叶斯分析。

In this section, we derive a generic method for solving the personalized ranking task. It consists of the general optimization criterion for personalized ranking, BPR-Opt, which will be derived by a Bayesian analysis of the problem using the likelihood function for p(i >u j|Θ) and the prior probability for the model parameter p(Θ)

在本节中，我们导出用于解决个性化排名任务的通用方法。 它由用于个性化排名的一般优化准则BPR-Opt组成，该准则将通过对问题的贝叶斯分析使用p(i> uj |Θ)的似然函数和模型参数p(Θ的先验概率)得出)

BPR优化准则 (BPR Optimization Criterion)

The Bayesian approach is to produce the rankings for all items i ∈ I to maximize the following posterior probability where Θ represents the parameter vector of an arbitrary model class

贝叶斯方法是产生所有项i∈I的排名，以最大化以下后验概率，其中Θ表示任意模型类的参数向量

p(Θ| >u) ∝ p(>u |Θ) p(Θ)

p(Θ|> u)∝ p(> u |Θ)p(Θ)

All user factors are independent with each other, and the ordering of each pair of items (i, j) for a specific user is unique.

所有用户因素彼此独立，并且特定用户的每对项目(i，j)的顺序是唯一的。

Hence, the above user-specific likelihood function can be reproduced with the formula below.

因此，可以使用以下公式来再现上述用户特定的似然函数。

User’s likelihood function

用户似然函数

We define the individual probability that a user really prefers item i to item j as:

我们将用户真正喜欢项目i而不是项目j的个体概率定义为：