Learning to rank with partially-labeled data
Lists
Only you see this
Abstract
Ranking algorithms, whose goal is to appropriately order a set of objects/documents, are an important component of information retrieval systems. Previous work on ranking algorithms has focused on cases where only labeled data is available for training (i.e. supervised learning). In this paper, we consider the question whether unlabeled (test) data can be exploited to improve ranking performance. We present a framework for transductive learning of ranking functions and show that the answer is affirmative. Our framework is based on generating better features from the test data (via KernelPCA) and incorporating such features via Boosting, thus learning different ranking functions adapted to the individual test queries. We evaluate this method on the LETOR (TREC, OHSUMED) dataset and demonstrate significant improvements.
BibTeX
@inproceedings{duh2008learning,
author = {Kevin Duh and Katrin Kirchhoff},
title = {{Learning to rank with partially-labeled data}},
booktitle = {International ACM SIGIR Conference on Research and Development in Information Retrieval},
year = {2008},
url = {https://openreview.net/forum?id=S1m2UrbObB},
}Loading related content...