The Recommender Problem Revisited

author: Xavier Amatriain, Netflix, Inc.
author: Bamshad Mobasher, College of Computing and Digital Media, DePaul University
published: Oct. 7, 2014,   recorded: August 2014,   views: 1189
Categories

Slides

Related Open Educational Resources

Related content

Report a problem or upload files

If 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.
Lecture popularity: You need to login to cast your vote.
  Bibliography

 Watch videos:   (click on thumbnail to launch)

Watch Part 1
Part 1 1:06:11
!NOW PLAYING
Watch Part 2
Part 2 55:42
!NOW PLAYING
Watch Part 3
Part 3 1:00:33
!NOW PLAYING

Description

In 2006, Netflix announced a $1M prize competition to advance recommendation algorithms. The recommendation problem was simplified as the accuracy in predicting a user rating measured by the Root Mean Squared Error. While that formulation helped get the attention of the research community in the area, it may have put an excessive focus on what is simply one of possible approaches to recommendations. In this tutorial we will describe different components of modern recommender systems such as: personalized ranking, similarity, explanations, context awareness, or search as recommendation. We will use the Netflix use case as a driving example of a prototypical industrial scale recommender system. We will also review the usage of modern algorithmic approaches that include algorithms such as Factorization Machines, Restricted Boltzmann Machines, SimRank, Deep Neural Networks, or Listwise Learningtorank.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: