Adapting ranking SVM to document retrieval

  • Authors:

  • Yunbo Cao;Jun Xu;Tie-Yan Liu;Hang Li;Yalou Huang;Hsiao-Wuen Hon

  • Affiliations:

  • Microsoft Research Asia, Beijing, China;Nankai University, Tianjin, China;Microsoft Research Asia, Beijing, China;Microsoft Research Asia, Beijing, China;Nankai University, Tianjin, China;Microsoft Research Asia, Beijing, China

  • Venue:
  • SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

Abstract

The paper is concerned with applying learning to rank to document retrieval. Ranking SVM is a typical method of learning to rank. We point out that there are two factors one must consider when applying Ranking SVM, in general a "learning to rank" method, to document retrieval. First, correctly ranking documents on the top of the result list is crucial for an Information Retrieval system. One must conduct training in a way that such ranked results are accurate. Second, the number of relevant documents can vary from query to query. One must avoid training a model biased toward queries with a large number of relevant documents. Previously, when existing methods that include Ranking SVM were applied to document retrieval, none of the two factors was taken into consideration. We show it is possible to make modifications in conventional Ranking SVM, so it can be better used for document retrieval. Specifically, we modify the "Hinge Loss" function in Ranking SVM to deal with the problems described above. We employ two methods to conduct optimization on the loss function: gradient descent and quadratic programming. Experimental results show that our method, referred to as Ranking SVM for IR, can outperform the conventional Ranking SVM and other existing methods for document retrieval on two datasets.