1 / 44

Recommender Systems

Recommender Systems. Eric Nalisnick CSE 435. …. How can businesses direct customers to groups of similar , interesting , relevant , and undiscovered items? . Recommender Systems!. Method #1: Memory-Based Collaborative Filtering. A. B. C. D. E. 0. 1. =. 0. C. 0.

lula
Download Presentation

Recommender Systems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Recommender Systems Eric Nalisnick CSE 435

  2. How can businesses direct customers to groups of similar, interesting, relevant, and undiscovered items?

  3. RecommenderSystems!

  4. Method #1: • Memory-Based Collaborative Filtering

  5. A B C D E

  6. 0 1 = 0 C 0

  7. Customer—Item Matrix

  8. = 0 B 0

  9. Customer—Item Matrix with User Reviews Sim .44 2.13 - 0 0

  10. Evaluation of Memory-Based Collaborative Filtering

  11. 1. Best for post-purchase recommendations.

  12. 2. Does not scale well. Customers Items

  13. 3. Very popular and very unpopular items are problematic. *In practice, can multiply values by inverse frequency

  14. 4. Cold Start Problem • How do we recommend new items? • How do we make recommendations for new users?

  15. 5. Susceptible to Black and Gray Sheep

  16. Method #2: • Knowledge-Based Collaborative Filtering

  17. Like traditional CBR systems…

  18. Similarity function?

  19. 13 12 9 1 17 15 7

  20. *Director, year, and color had unstable or negative weights.

  21. Evaluation of Knowledge-Based Collaborative Filtering

  22. 1. Better at pre-purchase recommendations than Memory-Based.

  23. 2. Efficient runtime. Can be as simple as descending K-D Tree.

  24. 3. Cold Start problem and popularity of an item are not an issue.

  25. 4. Not good at modeling the general preferences of a user.

  26. Method #3: • Hybrid Item-to-Item Collaborative Filtering

  27. A B C D E

  28. Item-to-Item Collaborative Filtering Algorithm For each item i1: For each customer cwho has bought i1: For each item i2 bought by c: Sim(i1, i2)

  29. Customer—Item Matrix

  30. Industry Example: • The Netflix Prize

  31. $1,000,000 prize

  32. Winning Team: • “Bellkor’s Pragmatic Chaos” • RMSE Reduction: 10.9%

  33. Lessons Learned… • 1. Baseline Predictors

  34. Lessons Learned… • 2. Binary view of Data: Rated or not rated.

  35. Lessons Learned… • 3. Restricted Boltzmann Machines.

  36. Lessons Learned… • 4. No one recommendation technique is best. Need to combine several.

  37. Summary • Memory-Based CF is best for post-purchase • Knowledge-Based CF is best for pre-purchase. • Hybrid methods generally work best • The data is as important as the algorithm

  38. Questions?

More Related