Recommender Systems Debapriyo Majumdar Information Retrieval – Spring 2015 Indian Statistical Institute Kolkata Credits to Bing Liu (UIC) and Angshul Majumdar.

Slides:



Advertisements
Similar presentations
Recommender Systems & Collaborative Filtering
Advertisements

Prediction Modeling for Personalization & Recommender Systems Bamshad Mobasher DePaul University Bamshad Mobasher DePaul University.
Jeff Howbert Introduction to Machine Learning Winter Collaborative Filtering Nearest Neighbor Approach.
COMP423 Intelligent Agents. Recommender systems Two approaches – Collaborative Filtering Based on feedback from other users who have rated a similar set.
1 RegionKNN: A Scalable Hybrid Collaborative Filtering Algorithm for Personalized Web Service Recommendation Xi Chen, Xudong Liu, Zicheng Huang, and Hailong.
Oct 14, 2014 Lirong Xia Recommender systems acknowledgment: Li Zhang, UCSC.
COLLABORATIVE FILTERING Mustafa Cavdar Neslihan Bulut.
Sean Blong Presents: 1. What are they…?  “[…] specific type of information filtering (IF) technique that attempts to present information items (movies,
Intro to RecSys and CCF Brian Ackerman 1. Roadmap Introduction to Recommender Systems & Collaborative Filtering Collaborative Competitive Filtering 2.
Recommender Systems Aalap Kohojkar Yang Liu Zhan Shi March 31, 2008.
Item-based Collaborative Filtering Idea: a user is likely to have the same opinion for similar items [if I like Canon cameras, I might also like Canon.
Rubi’s Motivation for CF  Find a PhD problem  Find “real life” PhD problem  Find an interesting PhD problem  Make Money!
Recommender Systems. In many cases, users are faced with a wealth of products and information from which they can choose. To alleviate this many web sites.
A shot at Netflix Challenge Hybrid Recommendation System Priyank Chodisetti.
CS345 Data Mining Recommendation Systems Netflix Challenge Anand Rajaraman, Jeffrey D. Ullman.
Recommendations via Collaborative Filtering. Recommendations Relevant for movies, restaurants, hotels…. Recommendation Systems is a very hot topic in.
Agent Technology for e-Commerce
Customizable Bayesian Collaborative Filtering Denver Dash Big Data Reading Group 11/19/2007.
Recommender systems Ram Akella February 23, 2011 Lecture 6b, i290 & 280I University of California at Berkeley Silicon Valley Center/SC.
1 Introduction to Recommendation System Presented by HongBo Deng Nov 14, 2006 Refer to the PPT from Stanford: Anand Rajaraman, Jeffrey D. Ullman.
Recommender Systems; Social Information Filtering.
Recommender systems Ram Akella November 26 th 2008.
CS 277: Data Mining Recommender Systems
Chapter 12 (Section 12.4) : Recommender Systems Second edition of the book, coming soon.
Item-based Collaborative Filtering Recommendation Algorithms
Dr. Guandong Xu Intelligent Web & Information Systems (IWIS) Department of Computer Science, Aalborg University Web Usage Mining & Personalization.
Performance of Recommender Algorithms on Top-N Recommendation Tasks
A NON-IID FRAMEWORK FOR COLLABORATIVE FILTERING WITH RESTRICTED BOLTZMANN MACHINES Kostadin Georgiev, VMware Bulgaria Preslav Nakov, Qatar Computing Research.
מערכות המלצה / Collaborative Filtering ד " ר אבי רוזנפלד.
Distributed Networks & Systems Lab. Introduction Collaborative filtering Characteristics and challenges Memory-based CF Model-based CF Hybrid CF Recent.
Collaborative Filtering Recommendation Reporter : Ximeng Liu Supervisor: Rongxing Lu School of EEE, NTU
Privacy risks of collaborative filtering Yuval Madar, June 2012 Based on a paper by J.A. Calandrino, A. Kilzer, A. Narayanan, E. W. Felten & V. Shmatikov.
EMIS 8381 – Spring Netflix and Your Next Movie Night Nonlinear Programming Ron Andrews EMIS 8381.
Chengjie Sun,Lei Lin, Yuan Chen, Bingquan Liu Harbin Institute of Technology School of Computer Science and Technology 1 19/11/ :09 PM.
Presented By :Ayesha Khan. Content Introduction Everyday Examples of Collaborative Filtering Traditional Collaborative Filtering Socially Collaborative.
Artificial Intelligence with Web Applications Dell Zhang Birkbeck, University of London 2010/11.
Temporal Diversity in Recommender Systems Neal Lathia, Stephen Hailes, Licia Capra, and Xavier Amatriain SIGIR 2010 April 6, 2011 Hyunwoo Kim.
A Content-Based Approach to Collaborative Filtering Brandon Douthit-Wood CS 470 – Final Presentation.
1 Collaborative Filtering & Content-Based Recommending CS 290N. T. Yang Slides based on R. Mooney at UT Austin.
Recommender Systems. Recommender Systems (RSs) n RSs are software tools providing suggestions for items to be of use to users, such as what items to buy,
Cosine Similarity Item Based Predictions 77B Recommender Systems.
Collaborative Filtering Zaffar Ahmed
Pearson Correlation Coefficient 77B Recommender Systems.
The Summary of My Work In Graduate Grade One Reporter: Yuanshuai Sun
Singular Value Decomposition and Item-Based Collaborative Filtering for Netflix Prize Presentation by Tingda Lu at the Saturday Research meeting 10_23_10.
Pairwise Preference Regression for Cold-start Recommendation Speaker: Yuanshuai Sun
Singular Value Decomposition and Item-Based Collaborative Filtering for Netflix Prize Presentation by Tingda Lu at the Saturday Research meeting 10_23_10.
Recommendation Algorithms for E-Commerce. Introduction Millions of products are sold over the web. Choosing among so many options is proving challenging.
Community-Based Link Prediction/Recommendation in the Bipartite Network of BoardGameGeek.com Brett Boge CS 765 University of Nevada, Reno.
Collaborative Filtering via Euclidean Embedding M. Khoshneshin and W. Street Proc. of ACM RecSys, pp , 2010.
User Modeling and Recommender Systems: recommendation algorithms
Matrix Factorization & Singular Value Decomposition Bamshad Mobasher DePaul University Bamshad Mobasher DePaul University.
Experimental Study on Item-based P-Tree Collaborative Filtering for Netflix Prize.
Company LOGO MovieMiner A collaborative filtering system for predicting Netflix user’s movie ratings [ECS289G Data Mining] Team Spelunker: Justin Becker,
Item-Based Collaborative Filtering Recommendation Algorithms Badrul Sarwar, George Karypis, Joseph Konstan, and John Riedl GroupLens Research Group/ Army.
Recommendation Systems By: Bryan Powell, Neil Kumar, Manjap Singh.
Collaborative Filtering - Pooja Hegde. The Problem : OVERLOAD Too much stuff!!!! Too many books! Too many journals! Too many movies! Too much content!
Item-Based Collaborative Filtering Recommendation Algorithms
Chapter 14 – Association Rules and Collaborative Filtering © Galit Shmueli and Peter Bruce 2016 Data Mining for Business Analytics (3rd ed.) Shmueli, Bruce.
COMP423 Intelligent Agents. Recommender systems Two approaches – Collaborative Filtering Based on feedback from other users who have rated a similar set.
Matrix Factorization and Collaborative Filtering
Data Mining: Concepts and Techniques
Recommender Systems & Collaborative Filtering
CF Recommenders.
MATRIX FACTORIZATION TECHNIQUES FOR RECOMMENDER SYSTEMS
Adopted from Bin UIC Recommender Systems Adopted from Bin UIC.
Collaborative Filtering Nearest Neighbor Approach
Movie Recommendation System
Recommendation Systems
Recommender Systems Group 6 Javier Velasco Anusha Sama
Presentation transcript:

Recommender Systems Debapriyo Majumdar Information Retrieval – Spring 2015 Indian Statistical Institute Kolkata Credits to Bing Liu (UIC) and Angshul Majumdar (IIITD) for the slides

Recommender systems Customer  Too many options.  How to choose the right one? Business How to increase revenue? How to recommend items customers like?

Recommender systems 3 Customers who viewed / bought this product also bought Since you are looking at this, you may also look at …

Recommender systems 4 Viewers who liked this movie also liked the other movies Since you are looking at this page, you may also like…

The Recommendation Problem  We have a set of users U and a set of items S to be recommended to the users.  Let p be an utility function that measures the usefulness of item s (  S) to user u (  U), i.e., – p : U × S  R, where R is a totally ordered set (e.g., non- negative integers or real numbers in a range)  Objective – Learn p based on the past data – Use p to predict the utility value of each item s (  S) to each user u (  U) CS583, Bing Liu, UIC 5

Two main formulations  Rating prediction: predict the rating score that a user is likely to give to an item that (s)he has not seen or used before – Rating on an unseen movie – In this case, the utility of item s to user u is the rating given to s by u  Item prediction: predict a ranked list of items that a user is likely to buy or use 6

Approaches Content-based recommendations:  The user will be recommended items similar to the ones the user preferred in the past Collaborative filtering (or collaborative recommendations):  The user will be recommended items that people with similar tastes and preferences liked in the past Hybrids: Combine collaborative and content-based methods 7

Content based recommendation  Will user u like item s?  Look at items similar to s; does u like them? – Similarity based on content – Example: a movie represented based on features as specific actors, director, genre, subject matter, etc  The user’s interest or preference is also represented by the same set of features (the user profile)  Candidate item s is compared with the user profile of u in the same feature space  Determine if u would like s, or  Top k similar items are recommended 8

Collaborative filtering  Collaborative filtering (CF): more studied and widely used recommendation approach in practice – k-nearest neighbor – association rules based prediction – matrix factorization  Key characteristic: predicts the utility of items for a user based on the items previously rated by other like-minded users (thus, collaborative) 9

k nearest neighbor approach  No model building  Utilizes the entire user-item database to generate predictions directly, i.e., there is no model building.  This approach includes both – User-based methods – Item-based methods 10

User based kNN CF  Let the record (or profile) of the target user be u (represented as a vector), and the record of another user be v (v  T).  The similarity between the target user, u, and a neighbor, v, can be calculated using the Pearson’s correlation coefficient: 11 where V is the set of k similar users, r v,i is the rating of user v given to item i  Compute the rating prediction of item i for target user u

Problems with user based CF  The problem with the user-based formulation of collaborative filtering is the lack of scalability: – it requires the real-time comparison of the target user to all user records in order to generate predictions  A variation of this approach that remedies this problem is called item-based CF 12

Item-based CF  The item-based approach works by comparing items based on their pattern of ratings across users. The similarity of items i and j is computed as follows: 13  After computing the similarity between items we select a set of k most similar items to the target item and generate a predicted value of user u’s rating where J is the set of k similar items

Association rule-based CF  Transaction database: users, items – User  Item: viewed, bought, liked  Find association rules such as – Bought X, bought Y  Bought Z – Confidence and support (how strong is this association)  Rank items based on measures such as confidence, subject to some minimum support  Further reading: association rule mining 14

Matrix factorization based CF  Gained popularity for CF in recent years due to its superior performance both in terms of recommendation quality and scalability.  Part of its success is due to the Netflix Prize contest for movie recommendation  Popularized a Singular Value Decomposition (SVD) based matrix factorization algorithm – The prize winning method of the Netflix Prize Contest employed an adapted version of SVD 15

How do we choose a movie?  Possibly, we look at a few factors – Genre (Action, Thriller, Western, Drama...) – Actor – Director (Tarantino, Nolan, Bergman...)  There are only a few factors that helps decide our choice (remember: content based)  But we do not know exactly which factors …

Latent Factor Model  Assumes that the factors affecting the choices are hidden / latent.  These factors need not be exactly known. – The item-j is characterized by m-factors – The user-a is characterized by his / her affinity towards these factors

Mathematical Formalism  Latent factor model assumes that the rating of a user on an item is just an inner-product of the users’ and items’ latent factors.  How do we use this model for prediction?

A holistic view  The matrix of interactions Items Users

A low-rank model  The matrix of ratings can be expressed as:  According to our assumption, the matrix is of low rank (m)

SVD-CF  The problem is to impute missing values in R  Challenge – missing entries.  Therefore... – Compute the column average to impute the missing values. – Compute the row average and subtract from all the elements of the filled matrix – A – Compute best m-rank approximation of A – Predict missing value as