Abstract
Semi-supervised ranking is a relatively new and important learning problem. Some semi-supervised learning to rank algorithms have been proposed by adapting existing pair-wise ranking algorithms into the semi-supervised setting. In contrast, there is comparatively little work in developing semi-supervised ranking algorithm based on the list-wise approach. In this paper, we proposed a semi-supervised extension of one of the state-of-the art list-wise ranking algorithm—AdaRank, for the task of learning to rank with partially labeled data. The proposed algorithm is a two-staged approach that combines the process of label propagation and a regularized version of AdaRank. The label propagation process is used to propagate the relevance labels from labeled instances to other unlabeled ones, so that more training data are available to learn the ranking function. The regularized version of AdaRank optimizes a novel performance measure, which incorporates both the usual Information Retrieval (IR) metrics and the smoothness of the ranking function. Experimental results on benchmark datasets show the advantage of our methods over existing pair-wise algorithms for the Information Retrieval measures.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Liu, T.Y.: Learning to Rank for Information Retrieval. Journal of Foundations and Trends in Information Retrieval, 225–331 (2002)
Collins, M., Koo, T.: Discriminative Reranking for Natural Language Parsing. Journal of Computational Linguistics, 25–70 (2005)
Weston, J., Kuang, R., Leslie, C., Noble, W.S.: Protein Ranking by Semi-supervised Network Propagation. Journal of BMC Bioinformatics (2006)
Cao, Z., Qin, T., Liu, T., Li, H.: Learning to Rank: from Pair-wise Approach to List-wise Approach. In: Proceedings of the 24th International Conference on Machine Learning, pp. 129–136 (2007)
Amini, M.R., Truong, T.V., Gutte, C.: A Boosting Algorithm for Learning Bipartite Ranking Functions with Partially Labeled Data. In: Proceedings of the 31st Annual International Conference on Research and Development in Information Retrieval, pp. 99–106 (2008)
Freund, Y., Iyer, R., Schapire, R., Singer, Y.: An Efficient Boosting Algorithm for Combining Preferences. Journal of Machine Learning Research, 933–969 (2003)
Cao, Y., Xu, J., Liu, T., Li, H., Huang, Y., Hon, H.: Adapting Ranking SVM to Document Retrieval. In: Proceedings of the 29th Annual International Conference on Research and Development in Information Retrieval, pp. 186–193 (2006)
Pan, Z.B., You, X., Chen, H., Tao, D.C., Pang, B.C.: Generalization Performance of Magnitude-preserving Semi-supervised Ranking with Graph-based Regularization. Journal of Information Sciences, 284–296 (2013)
Zhu, X.J.: Semi-supervised Learning Literature Survey. Technical Report 1530, Department of Computer Sciences, University of Wisconsin, Madison (2005)
Truong, V., Amini, M., Gallinari, P.: A Self-training Method for Learning to Rank with Unlabeled Data. In: Proceedings of the 16th European Symposium on Artificial Neural Networks, pp. 22–24 (2009)
Xu, J., Li, H.: AdaRank: A Boosting Algorithm for Information Retrieval. In: Proceedings of the 30th Annual International Conference on Research and Development in Information Retrieval, pp. 391–398 (2007)
Zhu, X.J., Ghahramani, Z.: Learning from Labeled and Unlabeled Data with Label Propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon (2002)
Li, P., Burges, J.C., Wu, Q.: McRank: Learning to Rank Using Multiple Classification and Gradient Boosting. In: Proceedings of the 21st Annual Conference on Neural Information Processing Systems (2007)
Liu, T.Y., Xu, J., Qin, T., Xiong, W.Y.: LETOR: Benchmark Dataset for Research on Learning to Rank for Information Retrieval. Journal of Information Retrieval, 346–374 (2010)
Hersh, W., Buckley, C., Leone, T.J., Hickam, D.: OHSUMED: An Interactive Retrieval Evaluation and New Large Test Collection for Research. In: Proceedings of the 17th Annual International Conference on Research and Development in Information Retrieval, pp. 192–201 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miao, Z., Tang, K. (2013). Semi-supervised Ranking via List-Wise Approach. In: Yin, H., et al. Intelligent Data Engineering and Automated Learning – IDEAL 2013. IDEAL 2013. Lecture Notes in Computer Science, vol 8206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41278-3_46
Download citation
DOI: https://doi.org/10.1007/978-3-642-41278-3_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41277-6
Online ISBN: 978-3-642-41278-3
eBook Packages: Computer ScienceComputer Science (R0)