An alternative ranking problem for search engines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4525 LNCS, Issue , 2007, Pages 1-22

  Cortes, Corinna ^a   Mohri, Mehryar ^a,b   Rastogi, Ashish ^b  

^a GOOGLE INC   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COST FUNCTIONS; DATA STRUCTURES; ERROR ANALYSIS; LEARNING SYSTEMS; PROBLEM SOLVING;

RANKING SYSTEMS; TRADE-OFF PARAMETERS;

SEARCH ENGINES;

EID: 37149011781     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72845-0_1     Document Type: Conference Paper

References (18)

1. Agarwal, S., Niyogi, P.: Stability and generalization of bipartite ranking algorithms. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS (LNAI), vol. 3559, Springer, Heidelberg (2005)
2. Bousquet, O., Elisseeff, A.: Algorithmic stability and generalization performance. Advances in Neural Information Processing Systems (NIPS 2000) (2000)
3. Bousquet, O., Elisseeff, A.: Stability and generalization. J. Mach. Learn. Res. 2, 499-526 (2002)
4. Chu, W., Keerthi, S.S.: New approaches to support vector ordinal regression. In: Proceedings of the 22nd International Conference on Machine Learning, pp. 145-152. ACM Press, New York, USA (2005)
5. Cortes, C., Mohri, M.: AUC Optimization vs. Error Rate Minimization. In: Advances in Neural Information Processing Systems (NIPS 2003), MIT Press, Vancouver, Canada (2004)
6. Cortes, C., Mohri, M., Rastogi, A.: Magnitude-preserving ranking algorithms (Technical Report TR-2007-887). Courant Institute of Mathematical Sciences, New York University (2007)
7. Crammer, K., Singer, Y.: Pranking with ranking. Advances in Neural Information Processing Systems (NIPS 2001) (2001)
8. Freund, Y., Iyer, R., Schapire, R.E., Singer, Y.: An efficient boosting algorithm for combining preferences. In: Proceedings of the 15th International Conference on Machine Learning, pp. 170-178. Morgan Kaufmann, Madison, San Francisco, US (1998)
9. Herbrich, R., Graepel, T., Obermayer, K.: Large margin rank boundaries for ordinal regression. In: Smola, Bartlett, Schoelkopf, Schuurmans (eds.) Advances in large margin classifiers, MIT Press, Cambridge, MA (2000)
10. Joachims, T.: Evaluating retrieval performance using clickthrough data (2002)
11. McCullagh, P.: Regression models for ordinal data. Journal of the Royal Statistical Society B, 42 (1980)
12. McCullagh, P., Neider, J.A.: Generalized linear models. Chapman & Hall, London (1983)
13. McDiarmid, C.: Concentration. Probabilistic Methods for Algorithmic Discrete Mathematics, pp. 195-248 (1998)
14. Netflix.: Netflix prize, http://www.netflixprize.com (2006)
15. Rudin, C., Cortes, C., Mohri, M., Schapire, R.E.: Margin-Based Ranking Meets Boosting in the Middle. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS (LNAI), vol. 3559, pp. 63-78. Springer, Heidelberg (2005)
16. Shashua, A., Levin, A.: Ranking with large margin principle: Two approaches. Advances in Neural Information Processing Systems (NIPS 2003) (2003)
17. Vapnik, V.N.: Statistical learning theory. Wiley-Interscience, New York (1998)
18. Wahba, G.: Spline models for observational data. SIAM [Society for Industrial and Applied Mathematics] (1990)