A Boosting Approach for Learning to Rank Using SVD with Partially Labeled Data

  • Authors:

  • Yuan Lin;Hongfei Lin;Zhihao Yang;Sui Su

  • Affiliations:

  • Department of Computer Science and Engineering, Dalian University of Technology, Dalian, China 116023;Department of Computer Science and Engineering, Dalian University of Technology, Dalian, China 116023;Department of Computer Science and Engineering, Dalian University of Technology, Dalian, China 116023;Department of Computer Science and Engineering, Dalian University of Technology, Dalian, China 116023

  • Venue:
  • AIRS '09 Proceedings of the 5th Asia Information Retrieval Symposium on Information Retrieval Technology
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Learning to rank has become a hot issue in the community of information retrieval. It combines the relevance judgment information with the approaches of both in information retrieval and machine learning, so as to learn a more accurate ranking function for retrieval. Most previous approaches only rely on the labeled relevance information provided, thus suffering from the limited training data size available. In this paper, we try to use Singular Value Decomposition (SVD) to utilize the unlabeled data set to extract new feature vectors, which are then embedded in a RankBoost leaning framework. We experimentally compare the performance of our approach against that without incorporating new features generated by SVD. The experimental results show that our approach can consistently improve retrieval performance across several LETOR data sets, thus indicating effectiveness of new SVD generated features for learning ranking function.