Machine-learned ranking techniques automatically learn a complex document ranking function given training data. These techniques have demonstrated the effectiveness and flexibility required of a commercial web search. However, manually labeled training data (with multiple absolute grades) has become the bottleneck for training a quality ranking function, particularly for a new domain. In this paper, we explore the adaptation of machine-learned ranking models across a set of geographically diverse markets with the market-specific pairwise preference data, which can be easily obtained from clickthrough logs. We propose a novel adaptation algorithm, Pairwise-Trada, which is able to adapt ranking models that are trained with multi-grade labeled training data to the target market using the target-market-specific pair-wise preference data. We present results demonstrating the efficacy of our technique on a set of commercial search engine data.
bibtex
Copied!
@inproceedings{bai:mlr-xfer,
year = {2010},
url = {http://dl.acm.org/citation.cfm?id=1944566.1944569},
title = {Cross-market model adaptation with pairwise preference data for web search ranking},
series = {COLING '10},
publisher = {Association for Computational Linguistics},
pages = {18--26},
numpages = {9},
location = {Beijing, China},
booktitle = {Proceedings of the 23rd International Conference on Computational Linguistics: Posters},
author = {Bai, Jing and Diaz, Fernando and Chang, Yi and Zheng, Zhaohui and Chen, Keke},
address = {Stroudsburg, PA, USA},
acmid = {1944569}
}