Comparing and evaluating information retrieval algorithms for news recommendation

Toine Bogers, Antal Van Den Bosch

Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

Abstract

In this paper, we argue that the performance of content-based news recommender systems has been hampered by using relatively old and simple matching algorithms. Using more current probabilistic retrieval algorithms results in significant performance boosts. We test our ideas on a test collection that we have made publicly available. We perform both binary and graded evaluation of our algorithms and argue for the need for more graded evaluation of content-based recommender systems.

Original languageEnglish
Title of host publicationRecSys'07 : Proceedings of the 2007 ACM Conference on Recommender Systems
Number of pages4
Publication date1 Dec 2007
Pages141-144
ISBN (Print)9781595937308
DOIs
Publication statusPublished - 1 Dec 2007
Externally publishedYes
EventRecSys'07: 2007 1st ACM Conference on Recommender Systems - Minneapolis, MN, United States
Duration: 19 Oct 200720 Oct 2007

Conference

ConferenceRecSys'07: 2007 1st ACM Conference on Recommender Systems
Country/TerritoryUnited States
CityMinneapolis, MN
Period19/10/200720/10/2007
Sponsor

Keywords

  • Content-based recommender systems
  • Probabilistic retrieval algorithms
  • Performance evaluation
  • Graded evaluation
  • Information retrieval

Fingerprint

Dive into the research topics of 'Comparing and evaluating information retrieval algorithms for news recommendation'. Together they form a unique fingerprint.

Cite this