Material Detail

Recommender Problems for Web Applications

Recommender Problems for Web Applications

This video was recorded at 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), Washington 2010. 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.


  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material


Log in to participate in the discussions or sign up if you are not already a MERLOT member.