Recommender Problems for Web Applications

author: Deepak Agarwal, LinkedIn Corporation
author: Bee-Chung Chen, LinkedIn Corporation
published: Oct. 1, 2010,   recorded: July 2010,   views: 10413
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 59:48
!NOW PLAYING
Watch Part 2
Part 2 1:10:35
!NOW PLAYING
Watch Part 3
Part 3 27:58
!NOW PLAYING

Description

In this half-day tutorial, we provide an in-depth introduction of data mining challenges that arise in the context of recommender problems for web applications. Since Netflix released a large movie ratings dataset, recommender problems have received considerable attention. The focus of this tutorial however is on web applications and we will cover topics that are significant extensions of those discussed in the context of Netflix contest. While the research pursued in the context of Netflix contest made great advances in “offline-research” (fitting model to historic data obtained from a recommender system), this tutorial goes beyond this and discusses important issues in “online-research” (the science of designing sequential schemes that serve items to users in an optimal fashion). At an abstract level, the goal of recommender systems is to display items from an inventory for each user visit to some website. Each display results in some response from the user (clicks, ratings and so on) that updates our belief about user preferences and results in better recommendations in the future. The data mining challenge is to construct a serving scheme or sequential design that learns user preferences through interactions with items in order to maximize some utility function over a long time horizon. For instance, a portal like Yahoo! maybe interested in constructing a serving scheme that displays articles to users visiting their front page to maximize click rates. The tutorial will begin with a formal definition of the problem through real life examples drawn from actual applications. We provide a detailed discussion of various scenarios under which recommendations may have to be made, including varying item pool size, dynamic versus static item pool, degrees of cold-start both for users and items, number of items to be selected for each display, user fatigue and so on. These scenarios go significantly beyond the classical movie recommendation problem. We then provide a comprehensive overview of state-of-the-art techniques in this area with detailed discussion of several open problems that we hope will stimulate further research. In particular, we describe time-series models, multi-armed bandit schemes, regression approaches, matrix factorization approaches, cold-start, similarity-based approaches exemplified through real world examples. We will end with detailed discussion of several technical challenges in this area.

See Also:

Download slides icon Download slides: kdd2010_agarwal_chen_rpwa.pdf (4.7 MB)


Help icon Streaming Video Help

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: