信息过滤.pptVIP

2 协作过滤 a technology wherein peer opinions are employed to predict the interests of others. Memory-based methods store massive raw user ratings in database which can be uploaded into computer memory at once to compute preference similarities among users. Here, a user rating corresponds to a point in a metric space. In contrast, model-based algorithms build abstract models upon raw ratings and recommend products using these light-weight models. 2.1 Memory-based collaborative filtering the Pearson correlation coefficient method to compute the similarities among users which are later used to group the like-minded users. Based on the opinions of like-minded users about a certain product, the recommender can infer the preference of a user who does not have a rating for this product. Two steps （1）计算用户相似度找到体系中最邻近的目标用户 Consider two users x and y and the intersection of their rated products contains m elements, i.e. they share m co-rated products. Let Rx,i (respectively Ry,i) denote the rating on product i by user x (respectively user y), which is typically in {1,2, 3, … ,5}. As a shorthand, we use (respectively ) to denote the average rating value of user x (respectively user y) over all the products. The similarity between user x and y is denoted by Sp(x,y): （3） User-Product Table Kate Luke Mike Nancy Music 1 1 4 2 Music 2 5 2 4 Music 3 3 5 Music 4 2 5 Music 5 4 1 Music 6 4.56 2 5 （2）基于计算得出的邻近用户预测用户在打分的产品上的喜好度 The prediction of user x on product i, denoted by Px,i. The most common approach is based on a weighted average of rating deviations of like-minded users. where n is the number of the selected nearest neighbors, and is user x’s average rating value over all products that he/she has rated so far. （4） The recommendation problem is to estimate the users ratings for the unrated products in the table to fill in the empty cells. To predict Kates rating on music 6, we first compute the similarity between Kate and Luke using Equation (3). Sp(