Document Type
Conference Proceeding
Publication Date
10-2008
Abstract
Learning to rank has become a popular method for web search ranking. Traditionally, expert-judged examples are the major training resource for machine learned web ranking, which is expensive to get for training a satisfactory ranking function. The demands for generating specific web search ranking functions tailored for different domains, such as ranking functions for different regions, have aggravated this problem. Recently, a few methods have been proposed to extract training examples from user clickthrough log. Due to the low cost of getting user preference data, it is attractive to combine these examples in training ranking functions. However, because of the different natures of the two types of data, they may have different influences on ranking function. Therefore, it is challenging to develop methods for effectively combining them in training ranking functions. In this paper, we address the problem of adapting an existing ranking function to user preference data, and develop a framework for conveniently tuning the contribution of the user preference data in the tuned ranking function. Experimental results show that with our framework it is convenient to generate a batch of adapted ranking functions and to select functions with different trade-offs between the base function and the user preference data.
Repository Citation
Chen, K.,
Zhang, Y.,
Zheng, Z.,
Zha, H.,
& Sun, G.
(2008). Adapting Ranking Functions to User Preference. .
https://corescholar.libraries.wright.edu/knoesis/325
Included in
Bioinformatics Commons, Communication Technology and New Media Commons, Databases and Information Systems Commons, OS and Networks Commons, Science and Technology Studies Commons
Comments
Paper presented at the ACM Conference on Information and Knowledge Management, Napa Valley, CA, October 26-30, 2008.