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

Probabilistic news recommender systems with feedback

Published:09 September 2012Publication History

ABSTRACT

In prior work we addressed a major problem faced by media sites with popularity based recommender systems such as the top-10 list of most liked or most clicked posts. We showed that the hard cutoff used in these systems to generate the "Top N"lists is prone to unduly penalizing good articles that may have just missed the cutoff. A solution to this was to generate recommendations probabilistically, which is an approach that has been shown to be robust against some manipulation techniques as well. The aim of this research is to introduce a class of probabilistic news recommender systems that incorporates widely practiced recommendation techniques as a special case. We establish our results in a special case of two articles using the urn models with feedback mechanism from probability theory.

References

  1. Berger, J. and Milkman, K. L. 2011. What Makes Content Viral? Journal of Marketing Research (To Appear).Google ScholarGoogle Scholar
  2. Bilton, N. 2012. Disruptions: Top 10 Lists Lead to Less Choice on the Web. The New York Times, April 1, 2012.Google ScholarGoogle Scholar
  3. Chung, F., Handjani, S. and Jungreis, D. 2003. Generalizations of Pólya's Urn Problem. Annals of Combinatorics 7 (2), 141--153.Google ScholarGoogle ScholarCross RefCross Ref
  4. Drinea, E., Frieze, A. and Mitzenmacher, M. 2002. Balls and Bins Models with Feedback. In Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete Algorithms (SODA 2002). Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Freedman, D. A. 1965. Bernard Friedman's Urn. The Annals of Mathematical Statistics, vol. 36(3), 956--970.Google ScholarGoogle ScholarCross RefCross Ref
  6. Khanin, K. and Khanin, R. 2001. A Probabilistic Model for the Establishment of Neuron Polarity. Journal of Mathematical Biology, 42, 26--40 (2001).Google ScholarGoogle ScholarCross RefCross Ref
  7. Lerman, K. and Ghosh, R. 2010. Information Contagion: an Empirical Study of Spread of News on Digg and Twitter Social Networks. In Proceedings of the 4th International Conference on Weblogs and Social Media (ICWSM'10).Google ScholarGoogle Scholar
  8. Mitzenmacher, M., Oliveira, R. and Spencer, J. 2004. A Scaling Result for Explosive Processes. 11 (2004), The Electronic Journal of Combinatorics.Google ScholarGoogle Scholar
  9. Pandey, S., Roy, S., Olston, C., Cho, J. and Chakrabarti, S. Shuffling a stacked deck: The case for partially randomized ranking of search engine results. VLDB Endowment, Norway, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Prawesh, S. and Padmanabhan, B. 2011. The "top N"News Recommender: Count Distortion and Manipulation Resistance. In Proceedings of the fifth ACM Conference on Recommender Systems (RecSys'11). ACM, New York, NY, USA, 237--244. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Shapiro, C. and Varian, H. 1999. Information Rules, Harvard Business School Press. 1999.Google ScholarGoogle Scholar
  12. Weber, T. E. 2010. Cracking the New York Times Popularity Code. The Daily Beast, December 19, 2010.Google ScholarGoogle Scholar

Index Terms

  1. Probabilistic news recommender systems with feedback

    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