Regularizing ad hoc retrieval scores
Lists
Only you see this
Abstract
The cluster hypothesis states: closely related documents tend to be relevant to the same request. We exploit this hypothesis directly by adjusting ad hoc retrieval scores from an initial retrieval so that topically related documents receive similar scores. We refer to this process as score regularization. Score regularization can be presented as an optimization problem, allowing the use of results from semi-supervised learning. We demonstrate that regularized scores consistently and significantly rank documents better than unregularized scores, given a variety of initial retrieval algorithms. We evaluate our method on two large corpora across a substantial number of topics.
BibTeX
@inproceedings{diaz2005regularizing,
author = {Fernando Diaz},
title = {{Regularizing ad hoc retrieval scores}},
booktitle = {ACM International Conference on Information and Knowledge Management},
year = {2005},
doi = {10.1145/1099554.1099722},
}Loading related content...