Skip to main navigation Skip to search Skip to main content

Comparing relevance feedback algorithms for web search

  • Vishwa Vinay*
  • , Ken Wood
  • , Natasa Milic-Frayling
  • , Ingemar J. Cox
  • *Corresponding author for this work
  • University College London
  • Microsoft USA

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We evaluate three different relevance feedback (RF)algorithms, Rocchio, Robertson/Sparck-Jones (RSJ)and Bayesian, in the context of Web search. We use a target-testing experimental procedure whereby a user must locate a specific document. For user relevance feedback, we consider all possible user choices of indicating zero or more relevant documents from a set of 10 displayed documents. Examination of the effects of each user choice permits us to compute an upper-bound on the performance of each RF algorithm.We ind that there is a significant variation in the upper-bound performance o the three RF algorithms and that the Bayesian algorithm approaches the best possible.

Original languageEnglish
Title of host publication14th International World Wide Web Conference, WWW2005
Pages1052-1053
Number of pages2
DOIs
Publication statusPublished - 2005
Externally publishedYes
Event14th International World Wide Web Conference, WWW2005 - Chiba, Japan
Duration: 10 May 200514 May 2005

Publication series

Name14th International World Wide Web Conference, WWW2005

Conference

Conference14th International World Wide Web Conference, WWW2005
Country/TerritoryJapan
CityChiba
Period10/05/0514/05/05

Keywords

  • Evaluation
  • Relevance feedback
  • Web search

Fingerprint

Dive into the research topics of 'Comparing relevance feedback algorithms for web search'. Together they form a unique fingerprint.

Cite this