{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T01:49:05Z","timestamp":1790387345520,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540729259","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72927-3_43","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T02:30:27Z","timestamp":1181615427000},"page":"604-619","source":"Crossref","is-referenced-by-count":9,"title":["Robust Reductions from Ranking to Classification"],"prefix":"10.1007","author":[{"given":"Maria-Florina","family":"Balcan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikhil","family":"Bansal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alina","family":"Beygelzimer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Don","family":"Coppersmith","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"Langford","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gregory B.","family":"Sorkin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"43_CR1","unstructured":"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)"},{"key":"43_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/11503415_3","volume-title":"Learning Theory","author":"S. Agarwal","year":"2005","unstructured":"Agarwal, S., Niyogi, P.: Stability and generalization of bipartite ranking algorithms. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS (LNAI), vol.\u00a03559, pp. 32\u201347. Springer, Heidelberg (2005)"},{"key":"43_CR3","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1137\/050623905","volume":"20","author":"N. Alon","year":"2006","unstructured":"Alon, N.: Ranking tournaments. SIAM Journal on Discrete Mathematics\u00a020, 137\u2013142 (2006)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"43_CR4","unstructured":"Bansal, N., Coppersmith, D., Sorkin, G.B.: A winner\u2013loser labeled tournament has at most twice as many outdegree misrankings as pair misrankings, IBM Research Report RC24107 (November 2006)"},{"key":"43_CR5","series-title":"Lecture Notes in Artificial Intelligence","first-page":"1","volume-title":"Learning Theory","author":"S. Cl\u00e9men\u00e7on","year":"2005","unstructured":"Cl\u00e9men\u00e7on, S., Lugosi, G., Vayatis, N.: Ranking and scoring using empirical risk minimization. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS (LNAI), vol.\u00a03559, pp. 1\u201315. Springer, Heidelberg (2005)"},{"key":"43_CR6","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1613\/jair.587","volume":"10","author":"W. Cohen","year":"1999","unstructured":"Cohen, W., Schapire, R., Singer, Y.: Learning to order things. Journal of Artificial Intelligence Research\u00a010, 243\u2013270 (1999)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"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\u2013782 (2006)","DOI":"10.1145\/1109557.1109642"},{"key":"43_CR8","unstructured":"Cortes, C., Mohri, M.: AUC optimization versus error rate minimization, Advances in Neural Information Processing Systems (NIPS) (2004)"},{"key":"43_CR9","first-page":"933","volume":"4","author":"Y. Freund","year":"2003","unstructured":"Freund, Y., Iyer, R., Schapire, R., Singer, Y.: An efficient boosting algorithm for combining preferences. J. of Machine Learning Research\u00a04, 933\u2013969 (2003)","journal-title":"J. of Machine Learning Research"},{"key":"43_CR10","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF02476378","volume":"15","author":"H. Landau","year":"1953","unstructured":"Landau, H.: On dominance relations and the structure of animal societies: III. The condition for a score structure. Bull. Math. Biophys.\u00a015, 143\u2013148 (1953)","journal-title":"Bull. Math. Biophys."},{"key":"43_CR11","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Learning Theory","author":"C. Rudin","year":"2005","unstructured":"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.\u00a03559, Springer, Heidelberg (2005)"},{"key":"43_CR12","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1093\/biomet\/48.3-4.303","volume":"48","author":"P. Slater","year":"1961","unstructured":"Slater, P.: Inconsistencies in a schedule of paired comparisons. Biometrika\u00a048, 303\u2013312 (1961)","journal-title":"Biometrika"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72927-3_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:08Z","timestamp":1605762488000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72927-3_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729259"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72927-3_43","relation":{},"subject":[]}}