Semi-supervised document retrieval |
| |
| Authors: | Ming Li Hang Li Zhi-Hua Zhou |
| |
| Institution: | 1. National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210093, China;2. Microsoft Research Asia, 49 Zhichun Road, Haidian District, Beijing 100080, China |
| |
| Abstract: | This paper proposes a new machine learning method for constructing ranking models in document retrieval. The method, which is referred to as SSRank, aims to use the advantages of both the traditional Information Retrieval (IR) methods and the supervised learning methods for IR proposed recently. The advantages include the use of limited amount of labeled data and rich model representation. To do so, the method adopts a semi-supervised learning framework in ranking model construction. Specifically, given a small number of labeled documents with respect to some queries, the method effectively labels the unlabeled documents for the queries. It then uses all the labeled data to train a machine learning model (in our case, Neural Network). In the data labeling, the method also makes use of a traditional IR model (in our case, BM25). A stopping criterion based on machine learning theory is given for the data labeling process. Experimental results on three benchmark datasets and one web search dataset indicate that SSRank consistently and almost always significantly outperforms the baseline methods (unsupervised and supervised learning methods), given the same amount of labeled data. This is because SSRank can effectively leverage the use of unlabeled data in learning. |
| |
| Keywords: | Information retrieval Machine learning Data mining Learning to rank Semi-supervised learning |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
