{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,14]],"date-time":"2026-10-14T10:48:36Z","timestamp":1791974916451,"version":"4.4.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2008,4,26]],"date-time":"2008-04-26T00:00:00Z","timestamp":1209168000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s10994-008-5058-6","type":"journal-article","created":{"date-parts":[[2008,4,25]],"date-time":"2008-04-25T11:07:09Z","timestamp":1209121629000},"page":"139-153","source":"Crossref","is-referenced-by-count":24,"title":["Robust reductions from ranking to classification"],"prefix":"10.1007","volume":"72","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","published-online":{"date-parts":[[2008,4,26]]},"reference":[{"key":"5058_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, S., & Niyogi, P. (2005). Stability and generalization of bipartite ranking algorithms. In Proceedings of the eighteenth annual conference on computational learning theory (COLT) (pp. 32\u201347).","DOI":"10.1007\/11503415_3"},{"key":"5058_CR2","unstructured":"Agarwal, S., Har-Peled, S., & Roth, D. (2005). A\u00a0uniform convergence bound for the area under the ROC curve. In Proceedings of the 10th international workshop on artificial intelligence and statistics."},{"key":"5058_CR3","unstructured":"Ailon, N., & Mohri, M. (2007). An efficient reduction of ranking to classification (Technical Report TR-2007-903). New York University."},{"key":"5058_CR4","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1137\/050623905","volume":"20","author":"N. Alon","year":"2006","unstructured":"Alon, N. (2006). Ranking tournaments. SIAM Journal on Discrete Mathematics, 20, 137\u2013142.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"5058_CR5","unstructured":"Bansal, N., Coppersmith, D., & Sorkin, G. B. (2006). A winner\u2013loser labeled tournament has at most twice as many outdegree misrankings as pair misrankings (IBM Research Report RC24107). November 2006."},{"key":"5058_CR6","doi-asserted-by":"crossref","unstructured":"Cl\u00e9men\u00e7on, S., Lugosi, G., & Vayatis, N. (2005). Ranking and scoring using empirical risk minimization. In Proceedings of the eighteenth annual conference on computational learning theory (COLT) (pp. 1\u201315).","DOI":"10.1007\/11503415_1"},{"key":"5058_CR7","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. (1999). Learning to order things. Journal of Artificial Intelligence Research, 10, 243\u2013270.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5058_CR8","doi-asserted-by":"crossref","unstructured":"Coppersmith, D., Fleischer, L., & Rudra, A. (2006). Ordering by weighted number of wins gives a\u00a0good ranking for weighted tournaments. In Proceeding of the 17th annual symposium on discrete algorithms (SODA) (pp. 776\u2013782).","DOI":"10.1145\/1109557.1109642"},{"key":"5058_CR9","unstructured":"Cortes, C., & Mohri, M. (2004). AUC optimization versus error rate minimization. In Advances in neural information processing systems (NIPS)."},{"key":"5058_CR10","first-page":"933","volume":"4","author":"Y. Freund","year":"2003","unstructured":"Freund, Y., Iyer, R., Schapire, R., & Singer, Y. (2003). An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4, 933\u2013969.","journal-title":"Journal of Machine Learning Research"},{"key":"5058_CR11","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF02476378","volume":"15","author":"H. Landau","year":"1953","unstructured":"Landau, H. (1953). On dominance relations and the structure of animal societies, III: the condition for a\u00a0score structure. Bulletin of Mathematical Biophysics, 15, 143\u2013148.","journal-title":"Bulletin of Mathematical Biophysics"},{"key":"5058_CR12","unstructured":"Langford, J., & Zadrozny, B. (2005). Estimating class membership probabilities using classifier learners. In Proceedings of the 10th international workshop on artificial intelligence and statistics."},{"key":"5058_CR13","unstructured":"Marshall, A., & Olkin, I. (1979). Mathematics in science and engineering: Vol.\u00a0143. Inequalities: theory of majorization and its applications. New York."},{"key":"5058_CR14","doi-asserted-by":"crossref","unstructured":"Rudin, C., Cortes, C., Mohri, M., & Schapire, R. (2005). Margin-based ranking meets boosting in the middle. In Proceedings of the eighteenth annual conference on computational learning theory (COLT).","DOI":"10.1007\/11503415_5"},{"key":"5058_CR15","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. (1961). Inconsistencies in a\u00a0schedule of paired comparisons. Biometrika, 48, 303\u2013312.","journal-title":"Biometrika"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-008-5058-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-008-5058-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-008-5058-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:40:25Z","timestamp":1559338825000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-008-5058-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,26]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["5058"],"URL":"https:\/\/doi.org\/10.1007\/s10994-008-5058-6","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,26]]}}}