Abstract
Learning a good ranking function plays a key role for many applications including the task of (multimedia) information retrieval. While there are a few rank learning methods available, most of them need to explicitly model the relations between every pair of relevant and irrelevant documents, and thus result in an expensive training process for large collections. The goal of this paper is to propose a general rank learning framework based on the margin-based risk minimization principle and develop a set of efficient rank learning approaches that can model the ranking relations with much less training time. Its flexibility allows a number of margin-based classifiers to be extended to their rank learning counterparts such as the ranking logistic regression developed in this paper. Experimental results show that this efficient learning algorithm can successfully learn a highly effective retrieval function for multimedia retrieval on the TRECVID’03-’05 collections.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Robertson, S.E., Sparck Jones, K.: Relevance weighting of search terms. Journal of the American Society for Informaiton Science 27 (1977)
Nallapati, R.: Discriminative models for information retrieval. In: Proc. of the 27th SIGIR conf. on information retrieval, pp. 64–71 (2004)
Joachims, T.: Optimizing search engines using clickthrough data. In: Proceedings of the 8th ACM SIGKDD intl. conf. on knowledge discovery and data mining, pp. 133–142. ACM Press, New York (2002)
Freund, Y., Iyer, R.D., Schapire, R.E., Singer, Y.: An efficient boosting algorithm for combining preferences. In: Proc. of the 15th Intl. Conf. on Machine Learning, San Francisco, CA, USA, pp. 170–178 (1998)
Burges, C., et al.: Learning to rank using gradient descent. In: Proceedings of the 22nd intl. conf. on machine learning, pp. 89–96 (2005)
Chua, T.-S., Neo, S.-Y., Goh, H.-K., Zhao, M., Xiao, Y., Wang, G.: Trecvid 2005 by nus pris. In: NIST TRECVID-2005 (November 2005)
Gao, J., Qi, H., Xia, X., Nie, J.-Y.: Linear discriminant model for information retrieval. In: Proceedings of the 28th international ACM SIGIR conference, pp. 290–297. ACM Press, New York (2005)
Herbrich, R., Graepel, T., Obermayer, K.: Large margin rank boundaries for ordinal regression. In: Smola, A.J., Bartlett, P.L., Scholkopf, B., Schuurmans, D. (eds.) Advances in Large Margin Classifiers. MIT Press, Cambridge (2000)
Crammer, K., Singer, Y.: Pranking with ranking. In: Proc. of the Advanced Neural Information Processing Systems (NIPS) (2001)
Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning. Springer Series in Statistics. Springer, Basel (2001)
Jordan, M.I., Jacobs, R.A.: Hierarchical mixtures of experts and the EM algorithm. Neural Computation 6, 181–214 (1994)
Smeaton, A.F., Over, P.: TRECVID: Benchmarking the effectiveness of information retrieval tasks on digital video. In: Bakker, E.M., Lew, M., Huang, T.S., Sebe, N., Zhou, X.S. (eds.) CIVR 2003. LNCS, vol. 2728. Springer, Heidelberg (2003)
Hauptmann, A., Chen, M.-Y., Christel, M., Huang, C., Lin, W.-H., Ng, T., Papernick, N., Velivelli, A., Yang, J., Yan, R., Yang, H., Wactlar, H.D.: Confounded expectations: Informedia at trecvid 2004. In: Proc. of TRECVID (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yan, R., Hauptmann, A.G. (2006). Efficient Margin-Based Rank Learning Algorithms for Information Retrieval. In: Sundaram, H., Naphade, M., Smith, J.R., Rui, Y. (eds) Image and Video Retrieval. CIVR 2006. Lecture Notes in Computer Science, vol 4071. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11788034_12
Download citation
DOI: https://doi.org/10.1007/11788034_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36018-6
Online ISBN: 978-3-540-36019-3
eBook Packages: Computer ScienceComputer Science (R0)