Rank aggregation methods for the Web
Proceedings of the 10th international conference on World Wide Web
Optimizing search engines using clickthrough data
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
An efficient boosting algorithm for combining preferences
The Journal of Machine Learning Research
Learning to rank: from pairwise approach to listwise approach
Proceedings of the 24th international conference on Machine learning
AdaRank: a boosting algorithm for information retrieval
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
An outranking approach for rank aggregation in information retrieval
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Query dependent ranking using K-nearest neighbor
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Learning to Rank for Information Retrieval
Foundations and Trends in Information Retrieval
Ranking with query-dependent loss for web search
Proceedings of the third ACM international conference on Web search and data mining
Ranking specialization for web search: a divide-and-conquer approach by using topical RankSVM
Proceedings of the 19th international conference on World wide web
Optimizing unified loss for web ranking specialization
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Learning to select a ranking function
ECIR'2010 Proceedings of the 32nd European conference on Advances in Information Retrieval
Hi-index | 0.00 |
The technologies of learning to rank have been successfully used in information retrieval. General ranking approaches use all training queries to build a single ranking model and apply this model to all different kinds of queries. Such a "global" ranking approach does not deal with the specific properties of queries. In this paper, we propose three query-dependent ranking approaches which combine the results of local models. We construct local models by using clustering algorithms, represent queries by using various ways such as Kull-back-Leibler divergence, and apply a ranking function to merge the results of different local models. Experimental results show that our approaches are better than all rank-based aggregation approaches and some global models in LETOR4. Especially, we found that our approaches have better performance in dealing with difficult queries.