skip to main content
10.1145/1089827.1089838acmotherconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
Article

Contextual recommender problems [extended abstract]

Published:21 August 2005Publication History

ABSTRACT

The contextual recommender task is the problem of making useful offers, e.g., placing ads or related links on a web page, based on the context information, e.g., contents of the page and information about the user visiting, and information on the available alternatives, i.e., the advertisements or relevant links. In the case of ads for example, the goal is to select ads that result in high click rates, where the (ad) click rate is some unknown function of the attributes of the context and ad. We describe the task and make connections to related problems including recommender and multi-armed bandit problems.

References

  1. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. The non-stochastic multi-armed bandit problem. SIAM Journal on Computing, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. D. A. Berry and B. Fristedt. Bandit Problems. Chapman and Hall, 1985.Google ScholarGoogle ScholarCross RefCross Ref
  3. J. Gittins. Multi-Armed Bandit Allocation Indices. John Wiley and Sons, 1989.Google ScholarGoogle Scholar
  4. T. Joachims. Optimizing search engines using clickthrough data. In Proceedings of the ACM Conference on Knowledge Discovery and Data Mining. ACM, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. J. Kleingberg, C. Papadimitriou, and P. Raghavan. Segmentation problems. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. O. Madani, D. J. Lizotte, and R. Greiner. The budgeted multi-armed bandit problem. In COLT, 2004.Google ScholarGoogle Scholar
  7. M. Perkowitz and O. Etzioni. Towards adaptable web sites: Conceptual framework and case study. Artificial Intelligence, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. P. Resnick and H. R. Varian. Recommender systems. Communications of the ACM, 40(3), 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. R. Sutton and A. G. Barto. Reinforcement Learning: An Introduction. MIT press, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Contextual recommender problems [extended abstract]

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      UBDM '05: Proceedings of the 1st international workshop on Utility-based data mining
      August 2005
      104 pages
      ISBN:1595932089
      DOI:10.1145/1089827

      Copyright © 2005 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 21 August 2005

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader