skip to main content
10.1145/2365952.2365974acmconferencesArticle/Chapter ViewAbstractPublication PagesrecsysConference Proceedingsconference-collections
research-article

How many bits per rating?

Published:09 September 2012Publication History

ABSTRACT

Most recommender systems assume user ratings accurately represent user preferences. However, prior research shows that user ratings are imperfect and noisy. Moreover, this noise limits the measurable predictive power of any recommender system. We propose an information theoretic framework for quantifying the preference information contained in ratings and predictions. We computationally explore the properties of our model and apply our framework to estimate the efficiency of different rating scales for real world datasets. We then estimate how the amount of information predictions give to users is related to the scale ratings are collected on. Our findings suggest a tradeoff in rating scale granularity: while previous research indicates that coarse scales (such as thumbs up / thumbs down) take less time, we find that ratings with these scales provide less predictive value to users. We introduce a new measure, preference bits per second, to quantitatively reconcile this tradeoff.

References

  1. X. Amatriain, J. Pujol, and N. Oliver. I like it... i like it not: Evaluating user ratings noise in recommender systems. In UMAP 2009, pages 247--258. Springer (2009), 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. X. Amatriain, J. M. Pujol, N. Tintarev, and N. Oliver. Rate it again: increasing recommendation accuracy by user re-rating. In RecSys 09. ACM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. D. Cosley, S. K. Lam, I. Albert, J. A. Konstan, and J. Riedl. Is seeing believing?: How recommender system interfaces affect users' opinions. In CHI 03. ACM, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. T. M. Cover and J. A. Thomas. Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing). Wiley-Interscience, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M. Ekstrand, M. Ludwig, J. Konstan, and J. Riedl. Rethinking the recommender research ecosystem: Reproducibility, openness, and LensKit. In RecSys 11, pages 133--140. ACM, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. D. Ekstrand, J. T. Riedl, and J. A. Konstan. Collaborative filtering recommender system. Foundations and Trends in Human-Computer Interaction, 4(2):81--173, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. B. Fischhoff. Value elicitation: is there anything in there? American Psychologist, 46(8):835, 1991.Google ScholarGoogle ScholarCross RefCross Ref
  8. W. R. Garner. Rating scales, discriminability, and information transmission. The Psychological Review, 67(6):343--352, 1960.Google ScholarGoogle ScholarCross RefCross Ref
  9. K. Goldberg, T. Roeder, D. Gupta, and C. Perkins. Eigentaste: A constant time collaborative filtering algorithm. Information Retrieval, 4(2):133--151, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. F. Harper, X. Li, Y. Chen, and J. Konstan. An economic model of user rating in an online recommender system. User Modeling, pages 149--149, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. L. Herlocker, J. A. Konstan, L. G. Terveen, and J. T. Riedl. Evaluating collaborative filtering recommender systems. ACM Trans. Inf. Syst., 22(1):5--53, Jan. 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. W. Hill, L. Stead, M. Rosenstein, and G. Furnas. Recommending and evaluating choices in a virtual community of use. In CHI 95, pages 194--201, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. G. Miller. Note on the bias of information estimates. Information theory in psychology: Problems and methods, 2:95--100, 1955.Google ScholarGoogle Scholar
  14. M. P. O'Mahony, N. J. Hurley, N. Kushmerick, and G. Silvestre. Collaborative recommendation: A robustness analysis. ACM Transactions on Internet Technology, 4:344--377, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. M. P. O'Mahony, N. J. Hurley, and G. C. Silvestre. Detecting noise in recommender system databases. In IUI 06. ACM, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. L. Paninski. Estimation of entropy and mutual information. Neural Computation, 15(6):1191--1253, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Item-based collaborative filtering recommendation algorithms. In WWW 2001, pages 285--295. ACM, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. S. Sen, J. Vig, and J. Riedl. Tagommenders: Connecting users to items through tags. In WWW 09, pages 671--680. ACM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. G. Shani and A. Gunawardana. Evaluating recommendation systems. Recommender Systems Handbook, pages 257--297, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  20. C. Shannon. A mathematical theory of communication. ACM SIGMOBILE Mobile Computing and Communications Review, 5(1):3--55, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. E. I. Sparling and S. Sen. Rating: How difficult is it? In RecSys 11. ACM, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Youtube. New video page launches for all users @http://youtube-global.blogspot.com/2010/03/new-video-page-launches-for-all-users.html, Mar. 2010.Google ScholarGoogle Scholar

Index Terms

  1. How many bits per rating?

      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

        • research-article

        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