Abstract

Learning to rank is becoming more and more popular in machine learning and information retrieval field. However, like many other supervised approaches, one of the main problems with learning to rank is lack of labeled data. Recently, there have been attempts to address the challenges in active sampling for learning to rank. But none of these methods take into consideration the differences between queries*. In this paper, we propose a novel active ranking framework on query-level which aims to employ different ranking models for different queries. Then, we used Rank SVM as a base ranker, realized a query-level active ranking algorithm and applied it to document retrieval. Experimental results on real-world data set show that our approach can reduce the labeling cost greatly without decreasing the ranking accuracy.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.