skip to main content
10.1145/2365952.2366002acmconferencesArticle/Chapter ViewAbstractPublication PagesrecsysConference Proceedingsconference-collections
short-paper

When recommenders fail: predicting recommender failure for algorithm selection and combination

Authors Info & Claims
Published:09 September 2012Publication History

ABSTRACT

Hybrid recommender systems --- systems using multiple algorithms together to improve recommendation quality --- have been well-known for many years and have shown good performance in recent demonstrations such as the NetFlix Prize. Modern hybridization techniques, such as feature-weighted linear stacking, take advantage of the hypothesis that the relative performance of recommenders varies by circumstance and attempt to optimize each item score to maximize the strengths of the component recommenders. Less attention, however, has been paid to understanding what these strengths and failure modes are. Understanding what causes particular recommenders to fail will facilitate better selection of the component recommenders for future hybrid systems and a better understanding of how individual recommender personalities can be harnessed to improve the recommender user experience. We present an analysis of the predictions made by several well-known recommender algorithms on the MovieLens 10M data set, showing that for many cases in which one algorithm fails, there is another that will correctly predict the rating.

References

  1. R. Burke. Hybrid recommender systems: Survey and experiments. User Modeling and User-Adapted Interaction, 12(4):331--370, Nov. 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. D. Ekstrand, P. Kannan, J. A. Stemper, J. T. Butler, J. A. Konstan, and J. T. Riedl. Automatically building research reading lists. In RecSys '10, pages 159--166. ACM, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. D. Ekstrand, M. Ludwig, J. A. Konstan, and J. T. Riedl. Rethinking the recommender research ecosystem: reproducibility, openness, and LensKit. In RecSys '11, pages 133--140. ACM, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S. Funk. Netflix update: Try this at home. http://sifter.org/~simon/journal/20061211.html, Dec. 2006.Google ScholarGoogle Scholar
  5. A. Gunawardana and G. Shani. A survey of accuracy evaluation metrics of recommendation tasks. J. Mach. Learn. Res., 10:2935--2962, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Herlocker, J. A. Konstan, and J. Riedl. An empirical analysis of design choices in Neighborhood-Based collaborative filtering algorithms. Inf. Retr., 5(4):287--310, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. S. M. McNee, J. Riedl, and J. A. Konstan. Making recommendations better: an analytic model for human-recommender interaction. In CHI '06 Extended Abstracts, pages 1103--1108. ACM, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. A. Paterek. Improving regularized singular value decomposition for collaborative filtering. In KDD Cup and Workshop 2007, Aug. 2007.Google ScholarGoogle Scholar
  9. P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl. GroupLens: an open architecture for collaborative filtering of netnews. In ACM CSCW '94, pages 175--186. ACM, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. B. Sarwar, G. Karypis, J. Konstan, and J. Reidl. Item-based collaborative filtering recommendation algorithms. In ACM WWW '01, pages 285--295. ACM, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Sill, G. Takacs, L. Mackey, and D. Lin. Feature-Weighted linear stacking. arXiv:0911.0460, Nov. 2009.Google ScholarGoogle Scholar
  12. R. Torres, S. M. McNee, M. Abel, J. A. Konstan, and J. Riedl. Enhancing digital libraries with TechLensGoogle ScholarGoogle Scholar
  13. . In ACM/IEEE JCDL '04, pages 228--236. ACM, 2004.Google ScholarGoogle Scholar
  14. A. Umyarov and A. Tuzhilin. Improving rating estimation in recommender systems using aggregation- and variance-based hierarchical models. In RecSys '09, pages 37--44, New York, New York, USA, 2009. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. When recommenders fail: predicting recommender failure for algorithm selection and combination

      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 Conferences
        RecSys '12: Proceedings of the sixth ACM conference on Recommender systems
        September 2012
        376 pages
        ISBN:9781450312707
        DOI:10.1145/2365952

        Copyright © 2012 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: 9 September 2012

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • short-paper

        Acceptance Rates

        RecSys '12 Paper Acceptance Rate24of119submissions,20%Overall Acceptance Rate254of1,295submissions,20%

        Upcoming Conference

        RecSys '24
        18th ACM Conference on Recommender Systems
        October 14 - 18, 2024
        Bari , Italy

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader