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.
- Berger, J. and Milkman, K. L. 2011. What Makes Content Viral? Journal of Marketing Research (To Appear).Google Scholar
- Bilton, N. 2012. Disruptions: Top 10 Lists Lead to Less Choice on the Web. The New York Times, April 1, 2012.Google Scholar
- Chung, F., Handjani, S. and Jungreis, D. 2003. Generalizations of Pólya's Urn Problem. Annals of Combinatorics 7 (2), 141--153.Google ScholarCross Ref
- 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 ScholarDigital Library
- Freedman, D. A. 1965. Bernard Friedman's Urn. The Annals of Mathematical Statistics, vol. 36(3), 956--970.Google ScholarCross Ref
- Khanin, K. and Khanin, R. 2001. A Probabilistic Model for the Establishment of Neuron Polarity. Journal of Mathematical Biology, 42, 26--40 (2001).Google ScholarCross Ref
- 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 Scholar
- Mitzenmacher, M., Oliveira, R. and Spencer, J. 2004. A Scaling Result for Explosive Processes. 11 (2004), The Electronic Journal of Combinatorics.Google Scholar
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- Shapiro, C. and Varian, H. 1999. Information Rules, Harvard Business School Press. 1999.Google Scholar
- Weber, T. E. 2010. Cracking the New York Times Popularity Code. The Daily Beast, December 19, 2010.Google Scholar
Index Terms
- Probabilistic news recommender systems with feedback
Recommendations
The "top N" news recommender: count distortion and manipulation resistance
RecSys '11: Proceedings of the fifth ACM conference on Recommender systemsThe broad motivation for our research is to build manipulation resistant news recommender systems. However, there can be several different algorithms that are used to generate news recommendations, and the strategies for manipulation resistance are ...
Exploring privacy concerns in news recommender systems
WI '17: Proceedings of the International Conference on Web IntelligenceWith the increasing ubiquity of access to online news sources, the news recommender systems are becoming widely popular in recent days. However, providing interesting news for each user is a challenging task in highly-dynamic news domain. Many news ...
Investigating serendipity in recommender systems based on real user feedback
SAC '18: Proceedings of the 33rd Annual ACM Symposium on Applied ComputingOver the past several years, research in recommender systems has emphasized the importance of serendipity, but there is still no consensus on the definition of this concept and whether serendipitous items should be recommended is still not a well-...
Comments