Share Email Print

Proceedings Paper

A self-training listwise method for learning to rank with partially labeled data
Author(s): Hai-jiang He
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Recently there has been a general direction in ranking algorithms that combine labeled and unlabeled data in document retrieval. Previous work for learning to rank has focused on cases where only the pairwise approach is available for essential ranking algorithms. This paper addresses the semi-supervised ranking problems where the listwise approach is used to construct ranking models. The method is an iterative self-training algorithm that in each iteration a ranking function is built by learning from the current set of labeled queries. The newly learned ranking function is produced, then it is used to teaching unlabeled query. The likelihood loss is employed to evaluate the similarity of two permutations for a given query. The experimental results show the effectiveness of the method proposed in this paper.

Paper Details

Date Published: 1 October 2011
PDF: 6 pages
Proc. SPIE 8285, International Conference on Graphic and Image Processing (ICGIP 2011), 828560 (1 October 2011); doi: 10.1117/12.913453
Show Author Affiliations
Hai-jiang He, Changsha Univ. (China)

Published in SPIE Proceedings Vol. 8285:
International Conference on Graphic and Image Processing (ICGIP 2011)
Yi Xie; Yanjun Zheng, Editor(s)

© SPIE. Terms of Use
Back to Top