Bipartite ranking through minimization of univariate loss

Proceedings of the 28th International Conference on Machine Learning, ICML 2011

Volumn , Issue , 2011, Pages 1113-1120

  Kotlowski, Wojciech ^a,c   Dembczyński, Krzysztof ^b,c   Hüllermeier, Eyke ^b  

^a CWI   (Netherlands)

^b PHILIPPS UNIVERSITY MARBURG   (Germany)

^c POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION METHODS; COST-SENSITIVE; EXPERIMENTAL STUDIES; LOSS FUNCTIONS; TRAINING EXAMPLE; UNIVARIATE;

LEARNING SYSTEMS;

CONFERENCE CALLS;

EID: 80053441004     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Agarwal, S., Graepel, T., Herbrich, R., Har-Pelend, S., and Roth, D. Generalization bounds for the area under the ROC curve. Journal of Machine Learning Research, 6:393-425, 2005.
2. Ailon, N. and Mohri, M. An efficient reduction of ranking to classification. In COLT, pp. 87-98, 2008.
3. Asuncion, A. and Newman, D.J. UCI Machine Learning Repository, 2007. URL http://www.ics.uci.edu/~mlearn/MLRepository.html.
4. Balcan, M.-F., Bansal, N., Beygelzimer, A., Coppersmith, D., Langford, J., and Sorkin, G. B. Robust reductions from ranking to classification. Machine Learning, 82:139-153, 2008.
5. Bartlett, P. L., Jordan, M. I., and McAuliffe, J. D. Convexity, classification, and risk bounds. Journal of the American Statistical Association, 101(473): 138-156, 2006. (Pubitemid 43500031)
6. Caruana, R., Joachims, T., and Backstrom, L. KDD-Cup 2004: Results and analysis. SIGKDD Explor. Newsl., 6:95-108, 2004.
7. Clémençon, S., Gábor, L., and Vayatis, N. Ranking and empirical minimization of U-statistics. Annals of Statistics, 36:844-874, 2008.
8. Cohen, W. W., Schapire, R. E., and Singer, Y. Learning to order things. Journal of Artificial Intelligence Research, 10:243-270, 1999. (Pubitemid 30573909)
9. Cortes, C. and Mohri, M. AUC optimization vs. error rate minimization. In NIPS. MIT Press, 2003.
10. Duchi, J., Mackey, L., and Jordan, M. On the consistency of ranking algorithms. In ICML 2010, 2010.
11. Freund, Y. and Schapire, Robert E. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119-139, 1997.
12. Freund, Y., Iyer, R., Schapire, R. E., and Singer, Y. An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4: 933-969, 2003.
13. Hastie, T., Tibshirani, R., and Friedman, J. H. Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer, 2003.
14. Herbrich, R., Graepel, T., and Obermayer, K. Regression models for ordinal data: A machine learning approach. Technical report TR-99/03, Technical University of Berlin, 1999.
15. Joachims, T. A support vector method for multivariate performance measures. In ICML 2005, pp. 377-384, 2005.
16. Joachims, T. Training linear SVMs in linear time. In ACM SIGKDD, pp. 217-226, 2006.
17. Rudin, C., Cortes, C., Mohri, M., and Schapire, R. E. Margin-based ranking meets boosting in the middle. In COLT, pp. 63-78, 2005.
18. Steck, H. Hinge rank loss and the area under the ROC curve. In ECML, Lecture Notes in Computer Science, pp. 347-358. Springer-Verlag, 2007.