Learning Bidirectional Similarity for Collaborative Filtering
author: Qiang Yang, The Hong Kong University of Science and Technology
author: Jian Tao Sun, Microsoft Research
author: Jianmin Wu, Microsoft Research
author: Zheng Chen, Microsoft Research
published: Oct. 10, 2008, recorded: September 2008, views: 309
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Memory-based collaborative filtering aims at predicting the utility of a certain item for a particular user based on the previous ratings from similar users and similar items. Previous studies in finding similar users and items are based on user-defined similarity metrics such as Pearson Correlation Coefficient or Vector Space Similarity which are not adaptive and optimized for different applications and datasets. Moreover, previous studies have treated the similarity function calculation between users and items separately. In this paper, we propose a novel adaptive bidirectional similarity metric for collaborative filtering. We automatically learn similarities between users and items simultaneously through matrix factorization. We show that our model naturally extends the memory based approaches. Theoretical analysis shows our model to be a novel generalization of the SVD model. We evaluate our method using three benchmark datasets, including MovieLens, EachMovie and Netflix, through which we show that our methods outperform many previous baselines.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !