推荐系统

推荐系统通过用户与物品的偏好数据构建稀疏的效用矩阵,目标是预测未知的用户喜好。获取效用矩阵可通过用户评分(显式)或行为推断(隐式)。推荐系统主要分为内容基、协同过滤和潜在因子模型三种方法。内容基系统基于物品属性相似性推荐;协同过滤关注用户与物品的关系,分为用户-用户和物品-物品两种;潜在因子模型利用UV分解(奇异值分解)推测效用矩阵。评价推荐系统的方法包括均方根误差、覆盖率和精度。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

1. The Utility Matrix

In a recommendation-system application there are two classes of entities, which we shall refer to as users and items. Users have preferences for certain items, and these preferences must be teased out of the data. The data itself is represented as a utility matrix, giving for each user-item pair, a value that represents what is known about the degree of preference of that user for that item. 

We assume that the matrix is sparse, meaning that most entries are “unknown.” The goal of a recommendation system is to predict the blanks in the utility matrix.

2. How to get the Utility Matirx

Without a utility matrix, it is almost impossible to recommend items. 

(1) We can ask users to rate items. <Explicit>

(2) We can make inferences from users’ behavior. <Implicit>

3. Extrapolate unknown ratings from the known ones. 

Mainly interested in high unknow ratings. We are not interested in knowing what you don't like but what you like.

There are three appraoches to recommender systems:

(1) Content-based

Content-Based systems focus on properties of items. Similarity of items is determined by measuring the similarity in their properties.

Item Profiles: for each item, creat an item profile. Profile is a set(vector) of features.

User ProfilesWe not only need to create vectors describing items; we need to create vectors with the same components that describe the user’s preferences. 

Recommending Items to Users Based on Content: u(x,i) = cos(x,i) x:user profile;i:item profile

(2) Collaborative Filtering

Collaborative-Filtering systems focus on the relationship between users and items. Similarity of items is determined by the similarity of the ratings of those items by the users who have rated both items. 

<1>User-user collaboration filtering

identifying similar users:

recommending what similar users like

<2>Item-item

For item i ,found other similar items.

Estimate rating for item i based.(on rating for similar items)

(3) Latent Factor Models

An entirely different approach to estimating the blank entries in the utility matrix is to conjecture that the utility matrix is actually the product of two long, thin matrices. This view makes sense if there are a relatively small set of features of items and users that determine the reaction of most users to most items. In this section, we sketch one approach to discovering two such matrices; the approach is called “UV-decomposition,” and it is an instance of a more general theory called SVD (singular-value decomposition)

4. Evaluating extrapolation methods.

How to measure success/perfoemance of recommendation methods.

(1) Root-mean-square error (RMSE)

(2) Coverage: number of items/users for which system can make predictions.

(3) Precision: accuracy of predictions

……

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值