{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T03:06:01Z","timestamp":1779159961943,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540352945","type":"print"},{"value":"9783540352969","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11776420_44","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T14:49:15Z","timestamp":1159454955000},"page":"605-619","source":"Crossref","is-referenced-by-count":120,"title":["Subset Ranking Using Regression"],"prefix":"10.1007","author":[{"given":"David","family":"Cossock","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"44_CR1","unstructured":"Bartlett, P., Jordan, M., McAuliffe, J.: Convexity, classification, and risk bounds. Technical Report 638, Statistics Department, University of California, Berkeley (2003) (to appear in JASA)"},{"key":"44_CR2","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1214\/009053604000000463","volume":"32","author":"G. Lugosi","year":"2004","unstructured":"Lugosi, G., Vayatis, N.: On the Bayes-risk consistency of regularized boosting methods. The Annals of Statistics\u00a032, 30\u201355 (2004)","journal-title":"The Annals of Statistics"},{"key":"44_CR3","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1214\/aos\/1079120130","volume":"32","author":"T. Zhang","year":"2004","unstructured":"Zhang, T.: Statistical behavior and consistency of classification methods based on convex risk minimization. The Annals of Statistics\u00a032, 56\u201385 (2004)","journal-title":"The Annals of Statistics"},{"key":"44_CR4","first-page":"1225","volume":"5","author":"T. Zhang","year":"2004","unstructured":"Zhang, T.: Statistical analysis of some multi-category large margin classification methods. Journal of Machine Learning Research\u00a05, 1225\u20131251 (2004)","journal-title":"Journal of Machine Learning Research"},{"key":"44_CR5","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1006\/jcom.2002.0642","volume":"18","author":"I. Steinwart","year":"2002","unstructured":"Steinwart, I.: Support vector machines are universally consistent. J. Complexity\u00a018, 768\u2013791 (2002)","journal-title":"J. Complexity"},{"key":"44_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/11503415_10","volume-title":"Learning Theory","author":"A. Tewari","year":"2005","unstructured":"Tewari, A., Bartlett, P.L.: On the consistency of multiclass classification methods. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS, vol.\u00a03559, pp. 143\u2013157. Springer, Heidelberg (2005)"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"Jarvelin, K., Kekalainen, J.: IR evaluation methods for retrieving highly relevant documents. In: SIGIR 2000, pp. 41\u201348 (2000)","DOI":"10.1145\/345508.345545"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., Hullender, G.: Learning to rank using gradient descent. In: ICML 2005 (2005)","DOI":"10.1145\/1102351.1102363"},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"Hanley, J., McNeil, B.: The meaning and use of the Area under a Receiver Operating Characetristic (ROC) curve. Radiology, 29\u201336 (1982)","DOI":"10.1148\/radiology.143.1.7063747"},{"key":"44_CR10","first-page":"393","volume":"6","author":"S. Agarwal","year":"2005","unstructured":"Agarwal, S., Graepel, T., Herbrich, R., Har-Peled, S., Roth, D.: Generalization bounds for the area under the ROC curve. Journal of Machine Learning Research\u00a06, 393\u2013425 (2005)","journal-title":"Journal of Machine Learning Research"},{"key":"44_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/11503415_2","volume-title":"Learning Theory","author":"S. Agarwal","year":"2005","unstructured":"Agarwal, S., Roth, D.: Learnability of bipartite ranking functions. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS, vol.\u00a03559, pp. 16\u201331. Springer, Heidelberg (2005)"},{"key":"44_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11503415_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, vol.\u00a03559, pp. 1\u201315. Springer, Heidelberg (2005)"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Rosset, S.: Model selection via the AUC. In: ICML 2004 (2004)","DOI":"10.1145\/1015330.1015400"},{"key":"44_CR14","doi-asserted-by":"crossref","first-page":"115","DOI":"10.7551\/mitpress\/1113.003.0010","volume-title":"Advances in Large Margin Classifiers","author":"R. Herbrich","year":"2000","unstructured":"Herbrich, R., Graepel, T., Obermayer, K.: Large margin rank boundaries for ordinal regression. In: Smola, A., Bartlett, P., Sch\u00f6lkopf, B., Schuurmans, D. (eds.) Advances in Large Margin Classifiers, pp. 115\u2013132. MIT Press, Cambridge (2000)"},{"key":"44_CR15","unstructured":"Cossock, D.: Method and apparatus for machine learning a document relevance function. US patent application, 20040215606 (2003)"},{"key":"44_CR16","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1162\/1532443041424319","volume":"4","author":"G. Blanchard","year":"2003","unstructured":"Blanchard, G., Lugosi, G., Vayatis, N.: On the rate of convergence of regularized boosting classifiers. Journal of Machine Learning Research\u00a04, 861\u2013894 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"44_CR17","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1162\/153244304773936108","volume":"4","author":"S. Mannor","year":"2003","unstructured":"Mannor, S., Meir, R., Zhang, T.: Greedy algorithms for classification - consistency, convergence rates, and adaptivity. Journal of Machine Learning Research\u00a04, 713\u2013741 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"44_CR18","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"J. Friedman","year":"2001","unstructured":"Friedman, J.: Greedy function approximation: A gradient boosting machine. The Annals of Statistics\u00a029, 1189\u20131232 (2001)","journal-title":"The Annals of Statistics"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11776420_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T18:48:10Z","timestamp":1707245290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11776420_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540352945","9783540352969"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11776420_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}