Magnitude-preserving ranking algorithms

ACM International Conference Proceeding Series

Volumn 227, Issue , 2007, Pages 169-176

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

^a GOOGLE INC   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; ERROR ANALYSIS; LEARNING SYSTEMS; PROBLEM SOLVING; SEARCH ENGINES;

MOVIE RECOMMENDATION; RANKING ALGORITHMS;

ALGORITHMS;

EID: 34547984570     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273496.1273518     Document Type: Conference Paper

References (15)

1. Agarwal, S., & Niyogi, P. (2005). Stability and generalization of bipartite ranking algorithms. Proceedings of the. Conference on Learning Theory (COLT 2005) (pp. 32-47). Springer, Heidelberg.
2. Bousquet, O., & Elisseeff, A. (2000). Algorithmic stability and generalization performance. Advances in Neural Information Processing Systems (NIPS 1999) (pp. 196-202).
3. Bousquet, O., & Elisseeff, A. (2002). Stability and generalization. Journal of Machine Learning Research, 2, 499-526.
4. Chu, W., & Keerthi, S. S. (2005). New approaches to support vector ordinal regression. Proceedings of International Conference on Machine Learning (ICML 2005) (pp. 145-152).
5. Cossock, D., & Zhang, T. (2006). Subset ranking using regression. Proceedings of the Conference on Learning Theory (COLT 2006) (pp. 605-619). Springer, Heidelberg.
6. Crammer, K., & Singer, Y. (2002). Pranking with ranking. Advances in Neural Information Processing Systems (NIPS 2001) (pp. 641-647).
7. Freund, Y., Iyer, R., Schapire, R. E., & Singer, Y. (1998). An efficient boosting algorithm for combining preferences. Proceedings of International Conference on Machine Learning (ICML 1998) (pp. 170-178).
8. Herbrich, R., Graepel, T., & Obermayer, K. (2000). Large margin rank boundaries for ordinal regression. In Advances in large margin classifiers, 115132. MIT Press, Cambridge, MA.
9. Joachims, T. (2002). Evaluating retrieval performance using clickthrough data. Proceedings of the SIGIR Workshop on Mathematical/Formal Methods in Information 2002.
10. McCullagh, P. (1980). Regression models for ordinal data. Journal of the Royal Statistical Society, B, 42.
11. McCullagh, P., & Nelder, J. A. (1983). Generalized linear models. Chapman & Hall, London.
12. McDiarmid, C. (1998). Concentration. Probabilistic Methods for Algorithmic Discrete Mathematics (pp. 195-248).
13. Rudin, C., Cortes, C., Mohri, M., & Schapire, R. E. (2005). Margin-based ranking meets boosting in the middle. Proceedings of the Conference on Learning Theory (COLT 2005) (pp. 63-78). Springer, Heidelberg.
14. Shashua, A., & Levin, A. (2003). Ranking with large margin principle: Two approaches. Advances in Neural Information Processing Systems (NIPS 2002) (pp. 937-944).
15. Vapnik, V. N. (1998). Statistical learning theory. New York: Wiley-Interscience.