Abstract
Most existing learning to rank methods only use content relevance of objects with respect to queries to rank objects. However, they ignore relationships among objects. In this paper, two types of relationships between objects, topic based similarity and word based similarity, are combined together to improve the performance of a ranking model. The two types of similarities are calculated using LDA andtf-idf methods, respectively. A novel ranking function is constructed based on the similarity information. Traditional gradient descent algorithm is used to train the ranking function. Experimental results prove that the proposed ranking function has better performance than the traditional ranking function and the ranking function only incorporating word based similarity between documents.
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
Herbrich, R., Graepel, T., Obermayer, K.: Support vector learning for ordinal regression. In: Ninth International Conference on Artificial Neural Networks, pp. 97–102. ENNS Press, Edinburgh (1999)
Freund, Y., Iyer, R., Schapire, R.E., Singer, Y.: An efficient boosting algorithm for Combining Preferences. Journal of Machine Learning Research 4, 933–969 (2003)
Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., Hullender, G.: Learning to rank using gradient descent. In: 22nd International Conference on Machine learning, pp. 89–96. ACM Press, New York (2005)
Cao, Z., Qin, T., Liu, T.Y., Tsai, M.F., Li, H.: Learning to rank: from pairwise approach to listwise approach. In: 24th International Conference on Machine learning, pp. 129–136. ACM Press, New York (2007)
Xia, F., Liu, T.Y., Wang, J., Zhang, W., Li, H.: Listwise Approach to Learning to Rank: Theory and Algorithm. In: 25th International Conference on Machine Learning, pp. 1192–1199. ACM Press, New York (2008)
Qin, T., Zhang, X.D., Tsai, M.F., Wang, D.S., Liu, T.Y., Li, H.: Query-level loss functions for information retrieval. Information Processing and Management 44, 838–855 (2008)
Qin, T., Liu, T.Y., Zhang, X.D., Wang, D.S., Xiong, W.Y., Li, H.: Learning to Rank Relational Objects and Its Application to Web Search. In: 17th International World Wide Web Conference Committee, pp. 407–416. ACM Press, New York (2008)
Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent Dirichlet Allocation. Journal of Machine Learning Research 3, 993–1022 (2003)
Wei, X., Croft, W.B.: LDA-Based Document Models for Ad-hoc Retrieval. In: 29th SIGIR Conference, pp. 178–185. ACM Press, New York (2006)
Liu, T.Y., Xu, J., Qin, T., Xiong, W., Li, H.: LETOR: Benchmark Dataset for Research on Learning to Rank for Information retrieval. In: SIGIR 2007 Workshop, pp. 1192–1199. ACM Press, New York (2007)
Jarvelin, K., Kekalainen, J.: IR evaluation methods for retrieving highly relevant documents. In: 23rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 41–48. ACM Press, New York (2000)
Ding, Y.X., Zhou, D., Xiao, M., Dong, L.: Learning to Rank Relational Objects Based on the Listwise Approach. In: 2011 International Joint Conference on Neural Networks, pp. 1818–1824. IEEE Press, New York (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, D., Ding, Y., You, Q., Xiao, M. (2011). Learning to Rank Documents Using Similarity Information between Objects. In: Lu, BL., Zhang, L., Kwok, J. (eds) Neural Information Processing. ICONIP 2011. Lecture Notes in Computer Science, vol 7063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24958-7_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-24958-7_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24957-0
Online ISBN: 978-3-642-24958-7
eBook Packages: Computer ScienceComputer Science (R0)