Robust reductions from ranking to classification

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

Volumn 4539 LNAI, Issue , 2007, Pages 604-619

  Balcan, Maria Florina ^a   Bansal, Nikhil ^b   Beygelzimer, Alina ^b   Coppersmith, Don ^c   Langford, John ^d   Sorkin, Gregory B ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c CENTER FOR COMMUNICATIONS RESEARCH   (United States)

^d YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; REGRESSION ANALYSIS; ROBUST CONTROL;

BINARY CLASSIFICATION; REGRESSED SCORES; ROBUST REDUCTIONS;

BINARY SEQUENCES;

EID: 38049064559     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72927-3_43     Document Type: Conference Paper

References (12)

1. Agarwal, S., Har-Peled, S., Roth, D.: A uniform convergence bound for the area under the ROC curve. In: Proceedings of the 10th International Workshop on Artificial Intelligence and Statistics (2005)
2. Agarwal, S., Niyogi, P.: Stability and generalization of bipartite ranking algorithms. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS (LNAI), vol. 3559, pp. 32-47. Springer, Heidelberg (2005)
3. Alon, N.: Ranking tournaments. SIAM Journal on Discrete Mathematics 20, 137-142 (2006)
4. Bansal, N., Coppersmith, D., Sorkin, G.B.: A winner-loser labeled tournament has at most twice as many outdegree misrankings as pair misrankings, IBM Research Report RC24107 (November 2006)
5. Clémençon, S., Lugosi, G., Vayatis, N.: Ranking and scoring using empirical risk minimization. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS (LNAI), vol. 3559, pp. 1-15. Springer, Heidelberg (2005)
6. Cohen, W., Schapire, R., Singer, Y.: Learning to order things. Journal of Artificial Intelligence Research 10, 243-270 (1999)
7. Coppersmith, D., Fleischer, L., Rudra, A.: Ordering by weighted number of wins gives a good ranking for weighted tournaments. In: Proceeding of the 17th Annual Symposium on Discrete Algorithms (SODA), pp. 776-782 (2006)
8. Cortes, C., Mohri, M.: AUC optimization versus error rate minimization, Advances in Neural Information Processing Systems (NIPS) (2004)
9. Freund, Y., Iyer, R., Schapire, R., Singer, Y.: An efficient boosting algorithm for combining preferences. J. of Machine Learning Research 4, 933-969 (2003)
10. Landau, H.: On dominance relations and the structure of animal societies: III. The condition for a score structure. Bull. Math. Biophys. 15, 143-148 (1953)
11. Rudin, C., Cortes, C., Mohri, M., Schapire, R.: Margin-based ranking meets Boosting in the middle. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS (LNAI), vol. 3559, Springer, Heidelberg (2005)
12. Slater, P.: Inconsistencies in a schedule of paired comparisons. Biometrika 48, 303-312 (1961)