{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T09:52:22Z","timestamp":1778320342740,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,10,18]],"date-time":"2012-10-18T00:00:00Z","timestamp":1350518400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s10044-012-0299-1","type":"journal-article","created":{"date-parts":[[2012,10,17]],"date-time":"2012-10-17T13:37:28Z","timestamp":1350481048000},"page":"475-496","source":"Crossref","is-referenced-by-count":11,"title":["An empirical comparison of learning algorithms for nonparametric scoring: the TreeRank algorithm and other methods"],"prefix":"10.1007","volume":"16","author":[{"given":"St\u00e9phan","family":"Cl\u00e9men\u00e7on","sequence":"first","affiliation":[]},{"given":"Marine","family":"Depecker","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Vayatis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,10,18]]},"reference":[{"key":"299_CR1","doi-asserted-by":"crossref","first-page":"4316","DOI":"10.1109\/TIT.2009.2025558","volume":"9","author":"S Cl\u00e9men\u00e7on","year":"2009","unstructured":"Cl\u00e9men\u00e7on S, Vayatis N (2009) Tree-based ranking methods. IEEE Trans Inf Theory 9:4316\u20134336","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"299_CR2","first-page":"3169","volume":"43","author":"S Cl\u00e9men\u00e7on","year":"2011","unstructured":"Cl\u00e9men\u00e7on S, Depecker M, Vayatis N (2011) Adaptive partitioning schemes for bipartite ranking. J Mach Learn 43(1):3169","journal-title":"Mach Learn J"},{"key":"299_CR3","doi-asserted-by":"crossref","unstructured":"Cl\u00e9men\u00e7on S, Depecker M, Vayatis N (2009) Bagging ranking trees. In: Proceedings of ICMLA, international conference on machine learning and applications","DOI":"10.1109\/ICMLA.2009.14"},{"key":"299_CR4","unstructured":"Cl\u00e9men\u00e7on S, Vayatis N (2010) Ranking forests (to be published)"},{"key":"299_CR5","first-page":"933","volume":"4","author":"Y Freund","year":"2003","unstructured":"Freund Y, Iyer R, Schapire RE, Singer Y (2003) An efficient boosting algorithm for combining preferences. J Mach Learn Res 4:933\u2013969","journal-title":"J Mach Learn Res"},{"key":"299_CR6","unstructured":"Hastie T, Tibshirani R (1990) Generalized additive models. Chapman & Hall, Boca Raton"},{"issue":"1","key":"299_CR7","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1198\/106186005X25619","volume":"14","author":"J Zhu","year":"2005","unstructured":"Zhu J, Hastie T (2005) Kernel logistic regression and the import vector machine. J Comput Graph Stat 14(1):185\u2013205","journal-title":"J Comput Graph Stat"},{"issue":"2","key":"299_CR8","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1214\/aos\/1016218223","volume":"28","author":"J Friedman","year":"2000","unstructured":"Friedman J, Hastie T, Tibshirani R (2000) Additive logistic regression: a statistical view of boosting. Ann Stat 28(2):337\u2013407","journal-title":"Ann Stat"},{"key":"299_CR9","doi-asserted-by":"crossref","unstructured":"Joachims T (2002) Optimizing search engines using clickthrough data. In: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining, pp 133\u2013142","DOI":"10.1145\/775047.775067"},{"key":"299_CR10","unstructured":"Pahikkala T, Tsivtsivadze E, Airola A, Boberg J, Salakoski T (2007) Learning to rank with pairwise regularized least-squares. In: Proceedings of SIGIR 2007 workshop on learning to rank for information retrieval, pp 27\u201333"},{"key":"299_CR11","doi-asserted-by":"crossref","unstructured":"Burges C, Shaked T, Renshaw E, Lazier A, Deeds M, Hamilton N, Hullender G (2005) Learning to rank using gradient descent. In: Proceedings of ICML, 22nd international conference on machine learning, pp 89\u201396","DOI":"10.1145\/1102351.1102363"},{"issue":"3","key":"299_CR12","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1111\/1541-0420.00071","volume":"59","author":"L Dodd","year":"2003","unstructured":"Dodd L, Pepe M (2003) Partial AUC estimation and regression. Biometrics 59(3):614\u2013623","journal-title":"Biometrics"},{"key":"299_CR13","first-page":"2671","volume":"8","author":"S Cl\u00e9men\u00e7on","year":"2007","unstructured":"Cl\u00e9men\u00e7on S, Vayatis N (2007) Ranking the Best Instances. J Mach Learn Res 8:2671\u20132699","journal-title":"J Mach Learn Res"},{"key":"299_CR14","unstructured":"Cl\u00e9men\u00e7on S, Vayatis N (2008) Empirical performance maximization for linear rank statistics. In: Proceedings of NIPS\u201908, conference on neural information processing systems, pp 305\u2013312"},{"key":"299_CR15","first-page":"2233","volume":"10","author":"C Rudin","year":"2009","unstructured":"Rudin C (2009) The P-norm push: a simple convex ranking algorithm that concentrates at the top of the list. J Mach Learn Res 10:2233\u20132271","journal-title":"J Mach Learn Res"},{"issue":"3","key":"299_CR16","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10791-007-9025-9","volume":"10","author":"S Robertson","year":"2007","unstructured":"Robertson S, Zaragoza H (2007) On rank-based effectiveness measures and optimization. Inf Retr 10(3):321\u2013339","journal-title":"Inf Retr"},{"issue":"473","key":"299_CR17","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1198\/016214505000000907","volume":"101","author":"P Bartlett","year":"2006","unstructured":"Bartlett P, Jordan M, McAuliffe J (2006) Convexity classification and risk bounds. J Am Stat Assoc 101(473):138\u2013156","journal-title":"J Am Stat Assoc"},{"key":"299_CR18","first-page":"775","volume":"8","author":"P Bartlett","year":"2007","unstructured":"Bartlett P, Tewari A (2007) Sparseness vs estimating conditional probabilities: some asymptotic results. J Mach Learn Res 8:775\u2013790","journal-title":"J Mach Learn Res"},{"key":"299_CR19","first-page":"131","volume":"9","author":"D Mease","year":"2008","unstructured":"Mease D, Wyner A (2008) Evidence contrary to the statistical view of boosting. J Mach Learn Res 9:131\u2013156","journal-title":"J Mach Learn Res"},{"key":"299_CR20","doi-asserted-by":"crossref","unstructured":"Devroye L, Gy\u00f6rfi L, Lugosi G (1996) A probabilistic theory of pattern recognition. Springer, Berlin","DOI":"10.1007\/978-1-4612-0711-5"},{"issue":"3","key":"299_CR21","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/s00365-010-9084-9","volume":"32","author":"S Cl\u00e9men\u00e7on","year":"2010","unstructured":"Cl\u00e9men\u00e7on S, Vayatis N (2010) Overlaying classifiers: a practical approach for optimal scoring. Constr Approx 32(3):619\u2013648","journal-title":"Constr Approx"},{"key":"299_CR22","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1051\/ps:2005018","volume":"9","author":"S Boucheron","year":"2005","unstructured":"Boucheron S, Bousquet O, Lugosi G (2005) Theory of classification: a survey of recent advances. ESAIM Probab Stat 9:323\u2013375","journal-title":"ESAIM Probab Stat"},{"key":"299_CR23","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1148\/radiology.143.1.7063747","volume":"143","author":"J Hanley","year":"1982","unstructured":"anley J, McNeil J (1982) The meaning and use of the area under a ROC curve. Radiology 143:29\u201336","journal-title":"Radiology"},{"key":"299_CR24","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1214\/009052607000000910","volume":"36","author":"S Cl\u00e9men\u00e7on","year":"2008","unstructured":"Cl\u00e9men\u00e7on S, Lugosi G, Vayatis N (2008) Ranking and empirical risk minimization of U-statistics. Ann Stat 36:844\u2013874","journal-title":"Ann Stat"},{"key":"299_CR25","doi-asserted-by":"crossref","unstructured":"Ailon N, Mohri M (2010) Preference-based learning to rank. Mach Learn J 80(2):189\u2013211","DOI":"10.1007\/s10994-010-5176-9"},{"key":"299_CR26","unstructured":"Breiman L, Friedman J, Olshen R, Stone C (1984) Classification, regression trees. Wadsworth and Brooks, Monterey"},{"key":"299_CR27","first-page":"1713","volume":"7","author":"FR Bach","year":"2006","unstructured":"Bach FR, Heckerman D, Eric H (2006) Considering cost asymmetry in learning classifiers. J Mach Learn Res 7:1713\u20131741","journal-title":"J Mach Learn Res"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-012-0299-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10044-012-0299-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-012-0299-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T15:22:38Z","timestamp":1562253758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10044-012-0299-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,18]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["299"],"URL":"https:\/\/doi.org\/10.1007\/s10044-012-0299-1","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,18]]}}}