HackerPapers

arXiv:1303.0665cs.IR

Personalized News Recommendation with Context Trees

Florent Garcin, Christos Dimitrakakis, Boi Faltings

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

The profusion of online news articles makes it difficult to find interesting articles, a problem that can be assuaged by using a recommender system to bring the most relevant news stories to readers. However, news recommendation is challenging because the most relevant articles are often new content seen by few users. In addition, they are subject to trends and preference changes over time, and in many cases we do not have sufficient information to profile the reader. In this paper, we introduce a class of news recommendation systems based on context trees. They can provide high-quality news recommendation to anonymous visitors based on present browsing behaviour. We show that context-tree recommender systems provide good prediction accuracy and recommendation novelty, and they are sufficiently flexible to capture the unique properties of news articles.

arXiv comments
Journal reference
Proceedings of the 7th ACM conference on Recommender systems (2013), pp. 105--112
DOI
doi:10.1145/2507157.2507166
Subjects
cs.IRInformation Retrieval cs.LGMachine Learning stat.MLMachine Learning (Statistics)

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from May 2016 to May 2016.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Why don't you try and read some research papers on this topic and then decide how you would want to build your algorithm? Some links - http://static.googleusercontent.com/media/research.google.co... http://insight-centre.org/sites/default/files/publications/1...…

      vaibkvView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.