Exploiting Hyperlinks to Learn a Retrieval Model

Information Retrieval (IR) aims at solving a ranking problem: given a query $q$ and a corpus $C$, the documents of $C$ should be ranked such that the documents relevant to $q$ appear above the others. This task is generally performed by ranking the documents $d \in C$ according to their similarity with respect to $q$, $sim (q,d)$. The identification of an effective function $a,b \to sim(a,b)$ could be performed using a large set of queries with their corresponding relevance assessments. However, such data are especially expensive to label, thus, as an alternative, we propose to rely on hyperlink data which convey analogous semantic relationships. We then empirically show that a measure $sim$ inferred from hyperlinked documents can actually outperform the state-of-the-art {\em Okapi} approach, when applied over a non-hyperlinked retrieval corpus.

Published in:
NIPS Workshop on Learning to Rank
Presented at:
NIPS Workshop on Learning to Rank
Whistler, Canada

Note: The status of this file is: Anyone

 Record created 2006-03-10, last modified 2020-07-30

Download fulltextPDF
External links:
Download fulltextURL
Download fulltextRelated documents
Rate this document:

Rate this document:
(Not yet reviewed)