recommendation systems
play

Recommendation Systems Stony Brook University CSE545, Fall 2016 - PowerPoint PPT Presentation

Recommendation Systems Stony Brook University CSE545, Fall 2016 From Frequent to Recommended From Frequent to Recommended Similar idea, but slightly different question: Frequent items: Which items belong together? Recommendation


  1. Recommendation Systems Stony Brook University CSE545, Fall 2016

  2. From Frequent to Recommended

  3. From Frequent to Recommended Similar idea, but slightly different question: ● Frequent items: Which items belong together? ● Recommendation Systems: ○ What other item will this user like? (based on previously liked items) ○ How much will user like item X?

  4. From Frequent to Recommended Similar idea, but slightly different question: ● Frequent items: Which items belong together? ● Recommendation Systems: ○ What other item will this user like? (based on previously liked items) ○ How much will user like item X?

  5. From Frequent to Recommended Similar idea, but slightly different question: ● Frequent items: Which items belong together? ● Recommendation Systems: ○ What other item will this user like? (based on previously liked ? items) ○ How much will user like item X?

  6. From Frequent to Recommended Similar idea, but slightly different question: ● Frequent items: Which items belong together? ● Recommendation Systems: ○ What other item will this user like? (based on previously liked items) ○ How much will user like item X?

  7. From Frequent to Recommended Similar idea, but slightly different question: ● Frequent items: Which items belong together? ● Recommendation Systems: ○ What other item will this user like? (based on previously liked items) ○ How much will user like item X?

  8. From Frequent to Recommended Past User Ratings

  9. Recommendation Systems Why Big Data? ● Data with many potential features (and sometimes observations) ● An application of techniques for finding similar items ○ Locality sensitive hashing ○ Clustering / dimensionality reduction

  10. Recommendation System: Example

  11. Enabled by Web Shopping ● Does Wal-Mart have everything you need?

  12. Enabled by Web Shopping ● Does Wal-Mart have everything you need? (thelongtail.com)

  13. Enabled by Web Shopping ● Does Wal-Mart have everything you need? ● A lot of products are only of interest to a small population (i.e. “long-tail products”). ● However, most people buy many products that are from the long-tail. ● Web shopping enables more choices (thelongtail.com) ○ Harder to search ○ Recommendation engines to the rescue

  14. Enabled by Web Shopping ● Does Wal-Mart have everything you need? ● A lot of products are only of interest to a small population (i.e. “long-tail products”). ● However, most people buy many products that are from the long-tail. ● Web shopping enables more choices (thelongtail.com) ○ Harder to search ○ Recommendation engines to the rescue

  15. A Model for Recommendation Systems Given: users , items, utility matrix

  16. A Model for Recommendation Systems Given: users , items, utility matrix Game of Fargo Ballers Silicon Walking user Thrones Valley Dead A 4 5 3 3 B 5 4 2 C 5 2

  17. A Model for Recommendation Systems Given: users , items, utility matrix Game of Fargo Ballers Silicon Walking user Thrones Valley Dead A 4 5 3 3 B 5 4 2 C 5 2 ? ? ?

  18. Recommendation Systems Problems to tackle: 1. Gathering ratings 2. Extrapolate unknown ratings a. Explicit: based on user ratings and reviews (problem: only a few users engage in such tasks) b. Implicit: Learn from actions (e.g. purchases, clicks) (problem: hard to learn low ratings) 3. Evaluation

  19. Recommendation Systems Problems to tackle: 1. Gathering ratings 2. Extrapolate unknown ratings a. Explicit: based on user ratings and reviews (problem: only a few users engage in such tasks) b. Implicit: Learn from actions (e.g. purchases, clicks) (problem: hard to learn low ratings) 3. Evaluation

  20. Recommendation Systems Problems to tackle: Common Approaches 1. Gathering ratings 1. Content-based 2. Collaborative 2. Extrapolate unknown ratings a. Explicit: based on user ratings and reviews 3. Latent Factor (problem: only a few users engage in such tasks) b. Implicit: Learn from actions (e.g. purchases, clicks) (problem: hard to learn low ratings) 3. Evaluation

  21. Recommendation Systems Problems to tackle: Common Approaches 1. Gathering ratings 1. Content-based 2. Collaborative 2. Extrapolate unknown ratings a. Explicit: based on user ratings and reviews 3. Latent Factor (problem: only a few users engage in such tasks) b. Implicit: Learn from actions (e.g. purchases, clicks) Key Challenge: (problem: hard to learn low ratings) New users have no ratings or history 3. Evaluation (a cold-start)

  22. Content-based Rec Systems Based on similarity of items to past items that they have rated.

  23. Content-based Rec Systems Based on similarity of items to past items that they have rated.

  24. Content-based Rec Systems Based on similarity of items to past items that they have rated. Build profiles of items (set of features); examples: 1. shows: producer, actors, theme, review people: friends, posts pick words with tf-idf

  25. Content-based Rec Systems Based on similarity of items to past items that they have rated. Build profiles of items (set of features); examples: 1. shows: producer, actors, theme, review people: friends, posts pick words with tf-idf Construct user profile from item profiles; approach: 2. average all item profiles variation: weight by difference from their average

  26. Content-based Rec Systems Based on similarity of items to past items that they have rated. Build profiles of items (set of features); examples: 1. shows: producer, actors, theme, review people: friends, posts pick words with tf-idf Construct user profile from item profiles; approach: 2. average all item profiles variation: weight by difference from their average Predict ratings for new items; approach: 3. x i

  27. Why Content Based? ● Only need users history ● Captures unique tastes ● Can recommend new items ● Can provide explanations

  28. Why Content Based? ● Only need users history ● Need good features ● Captures unique tastes ● New users don’t have history ● Can recommend new items ● Doesn’t venture “outside the box” ● Can provide explanations (Overspecialized)

  29. Why Content Based? ● Only need users history ● Need good features ● Captures unique tastes ● New users don’t have history ● Can recommend new items ● Doesn’t venture “outside the box” ● Can provide explanations (Overspecialized) (not exploiting other users judgments)

  30. Collaborative Filtering Rec Systems ● Need good features ● New users don’t have history ● Doesn’t venture “outside the box” (Overspecialized) (not exploiting other users judgments)

  31. Collaborative Filtering Rec Systems ● Need good features ● New users don’t have history ● Doesn’t venture “outside the box” (Overspecialized) (not exploiting other users judgments)

  32. Collaborative Filtering Rec Systems Game of Fargo Ballers Silicon Walking user Thrones Valley Dead A 4 5 2 3 B 5 4 2 C 5 2

  33. Collaborative Filtering Rec Systems Game of Fargo Ballers Silicon Walking user Thrones Valley Dead A 4 5 2 3 B 5 4 2 C 5 2 Find Similarity 1. (need to handle missing values) : subtract user’s mean

  34. Collaborative Filtering Rec Systems Game of Fargo Ballers Silicon Walking user Thrones Valley Dead A 4 => 0.5 5 => 1.5 2 => -1.5 => 0 3 => -0.5 B 5 4 2 C 5 2 Given user, x, item, i Find neighborhood, N -- set of k users most similar to x 1. who have also rated i Find similarity between all users (using cosine sim) (need to handle missing values) : subtract user’s mean

  35. Collaborative Filtering Rec Systems Game of Fargo Ballers Silicon Walking user Thrones Valley Dead A 4 => 0.5 5 => 1.5 2 => -1.5 => 0 3 => -0.5 B 5 4 2 C 5 2 Given user, x, item, i Find neighborhood, N -- set of k users most similar to x 1. who have also rated i Find similarity between all users (using cosine sim) (need to handle missing values) : subtract user’s mean Predict utility (rating); options: 2. a. take average b. weight average by similarity

  36. Collaborative Filtering Rec Systems “User-User collaborative filtering” Given user, x, item, i Find neighborhood, N -- set of k users most similar to x 1. who have also rated i Find similarity between all users (need to handle missing values) : subtract user’s mean Predict utility (rating); options: 2. a. take average b. weight average by similarity

  37. Collaborative Filtering Rec Systems “User-User collaborative filtering” Item-Item: Flip rows/columns of utility matrix and use same methods. Game of Fargo Ballers Silicon Walking user Thrones Valley Dead A 4 5 2 3 B 5 4 2 C 5 2

  38. CF: Example

  39. CF: Example

  40. CF: Example Same as cosine sim when substracting the mean

  41. CF: Example

  42. CF: Example utility (1, 5) = (0.41*2 + 0.59*3) / (0.41+0.59)

  43. Item-Item v User-User ● Item-item often works better than user-user Users tend to be more different than each other than items are from each other. (e.g. user A likes jazz + rock, user B likes classical + rock, but user-A may still have same rock preferences as B; Users span genres but items usually do not)

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend