Xue-wen Chen
ABSTRACT
While conventional ranking algorithms, such as the PageRank, rely on the web structure to decide the relevancy of a web page, learning to rank seeks a function capable of ordering a set of instances using a supervised learning approach. Learning to rank has gained increasing popularity in information retrieval and machine learning communities. In this paper, we propose a novel nonlinear perceptron method for rank learning. The proposed method is an online algorithm and simple to implement. It introduces a kernel function to map the original feature space into a nonlinear space and employs a perceptron method to minimize the ranking error by avoiding converging to a solution near the decision boundary and alleviating the effect of outliers in the training dataset. Furthermore, unlike existing approaches such as RankSVM and RankBoost, the proposed method is scalable to large datasets for online learning. Experimental results on benchmark corpora show that our approach is more efficient and achieves higher or comparable accuracies in instance ranking than state of the art methods such as FRank, RankSVM and RankBoost.
- Page, L., Brin, S., Motwani, R., and Winograd, T. 1998. The pagerank citation ranking: Bring order to the web. Technical report, Stanford University.Google Scholar
- Burges, C. 2005. Ranking as Learning Structured Outputs. Proceedings of the NIPS 2005 Workshop on Learning to Rank, 7--11.Google Scholar
- Brinker, K. and Hullermeier, E. 2005. Calibrated Label-Ranking. Proceedings of the NIPS 2005 Workshop on Learning to Rank, 1--6.Google Scholar
- Grangier, D. and Bengio, S. 2005. Exploiting Hyperlinks to Learn a Retrieval Model. Proceedings of the NIPS 2005 Workshop on Learning to Rank, 12--17.Google Scholar
- Panikkaia, T., Tsivtsiadze, E., Airola, A., Boberg, J., and Salakoski, T. 2007. Learning to Rank with Pairwise Regularized Least--Squares. In Proceedings of SIGIR 2007 Workshop on Learning to Rank for Information Retrieval.Google Scholar
- Cao, G., Nie, J., Si, L., and Bai, J. 2007. Learning to Rank Documents for Ad-Retrieval with Regularized Models. In Proceedings of SIGIR 2007 Workshop on Learning to Rank for Information Retrieval.Google Scholar
- Yeh, J., Lin, J., Ke, H., and Yang, W. 2007. Learning to Rank for Information Retrieval using genetic Programming. In Proceedings of SIGIR 2007 Workshop on Learning to Rank for Information Retrieval.Google Scholar
- Veloso, A., Almeida, H., Goncalves, M., and Meira Jr., W. 2008. Learning to Rank at Query-time Using Association Rules. Proceedings of the 31th Annual Internaitonal ACM SIGIR Conference on Research and Development in Information Retrieval, 267--274. Google ScholarDigital Library
- Cao, Z., Qin, T., Liu, T., Tsai, M., and Li, H., 2007. Learning to Rank: from Pairwise Approach to Listwise Approach. Proceedings of the 24th International Conference on Machine Learning, 129--136. Google ScholarDigital Library
- Thorsten Joachims, 2002. Optimizing search engines using clickthrough data. In Proceedings of the Eighth SIGKDD, 133--142. Google ScholarDigital Library
- Yoav Freund, Raj Iyer, Robert E Schapire, and Yoram Singer, 2003. An efficient boosting algorithm for combining preferences. In J. Mach. Learn. Res., 4:933--969. Google ScholarDigital Library
- Raul Rojas, 1996. Neural Networks: A Systematic Introduction. Springer. Google ScholarDigital Library
- Koby Crammer, Yoram Singer, 2001. Pranking for ranking. In Advances in Neural Information Processing Systems 14.Google Scholar
- Chris Burges, Tal Shaked, Erin Renshaw, Matt Deeds, Nicole Hamilton, and Greg Hullender, 2005. Learning to rank using gradient descent. In ICML, pages 89--96. Google ScholarDigital Library
- T. Graepel, R. Herbrich, and R.C. Williamson, 2001. From Margin to Sparsity. In Advances in Neural Information Processing Systems, 210--216.Google Scholar
- Scholkopf, B. and Smola, A. 2002. Learning with Kernels. MIT Press, Cambridge, MA.Google Scholar
- Cristianini, N. and Shawe-Taylor, J., 2000. An Introduction to support Vector machines. Cambridge University Press, Cambridge, UK. Google ScholarDigital Library
- Liu, T., Qin, T., Xu, J., Xiong, W., and Li, H. 2007. LETOR: Benchmark dataset for research on learning to rank for information retrieval. LR3IR 2007, in conjunction with SIGIR 2007. Google ScholarDigital Library
- Baeza-Yates, R. and Ribeiro-Neto, B. 1999. Modern information retrieval. Addison Wesley, 1999. Google ScholarDigital Library
- Jarvelin, K. and Kekalainen, J. 2000. IR evaluation methods for retrieving highly relevant documents. Proceedings of SIGIR, 41--48. Google ScholarDigital Library
- Jarvelin, K. and Kekalainen, 2002. Cumulated gain-based evaluation of IR techniques. ACM Trans. on Information Systems, 20(4), 422--446. Google ScholarDigital Library
Index Terms
- Learning to rank with a novel kernel perceptron method
Recommendations
Quality-biased ranking for queries with commercial intent
WWW '13 Companion: Proceedings of the 22nd International Conference on World Wide WebModern search engines are good enough to answer popular commercial queries with mainly highly relevant documents. However, our experiments show that users behavior on such relevant commercial sites may differ from one to another web-site with the same ...
Incremental learning to rank with partially-labeled data
WSCD '09: Proceedings of the 2009 workshop on Web Search Click DataIn this paper we present a semi-supervised learning method for a problem of learning to rank where we exploit Markov random walks and graph regularization in order to incorporate not only "labeled" web pages but also plenty of "un-labeled" web pages (...
Learning to rank code examples for code search engines
Source code examples are used by developers to implement unfamiliar tasks by learning from existing solutions. To better support developers in finding existing solutions, code search engines are designed to locate and rank code examples relevant to user'...
Comments