{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T13:28:43Z","timestamp":1748957323917},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"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":[[2011,4]]},"DOI":"10.1007\/s10994-010-5190-y","type":"journal-article","created":{"date-parts":[[2010,6,4]],"date-time":"2010-06-04T19:58:05Z","timestamp":1275681485000},"page":"31-69","source":"Crossref","is-referenced-by-count":13,"title":["Adaptive partitioning schemes for bipartite ranking"],"prefix":"10.1007","volume":"83","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":[[2010,6,5]]},"reference":[{"key":"5190_CR1","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1214\/08-EJS196","volume":"3","author":"S. Arlot","year":"2009","unstructured":"Arlot, S. (2009). Model selection by resampling techniques. Electronic Journal of Statistics, 3, 557\u2013624.","journal-title":"Electronic Journal of Statistics"},{"key":"5190_CR2","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 some recent advances. ESAIM: Probability and Statistics, 9, 323\u2013375.","journal-title":"ESAIM: Probability and Statistics"},{"key":"5190_CR3","unstructured":"Breiman, L., Friedman, J., Olshen, R., & Stone, C. (1984). Classification and regression trees. Wadsworth and Brooks."},{"key":"5190_CR4","series-title":"ACM international conference proceeding series","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/1102351.1102363","volume-title":"Proceedings of the 22nd international conference on machine learning","author":"C. Burges","year":"2005","unstructured":"Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., & Hullender, G. (2005). Learning to rank using gradient descent. In ACM international conference proceeding series : Vol. 119. Proceedings of the 22nd international conference on machine learning (pp. 89\u201396). New York: ACM."},{"key":"5190_CR5","unstructured":"Cl\u00e9men\u00e7on, S., & Vayatis, N. (2008). Tree-structured ranking rules and approximation of the optimal ROC curve. In ALT \u201908: Proceedings of the 2008 conference on algorithmic learning theory."},{"key":"5190_CR6","unstructured":"Cl\u00e9men\u00e7on, S., & Vayatis, N. (2008). Overlaying classifiers: a practical approach for optimal ranking. In NIPS \u201908: Proceedings of the 2008 conference on advances in neural information processing systems."},{"key":"5190_CR7","unstructured":"Cl\u00e9men\u00e7on, S., & Vayatis, N. (2009). On partitioning rules for bipartite ranking. Journal of Machine Learning Research: Proceedings of AISTATS \u201909"},{"issue":"9","key":"5190_CR8","doi-asserted-by":"crossref","first-page":"4316","DOI":"10.1109\/TIT.2009.2025558","volume":"55","author":"S. Cl\u00e9men\u00e7on","year":"2009","unstructured":"Cl\u00e9men\u00e7on, S., & Vayatis, N. (2009). Tree-based ranking methods. IEEE Transactions on Information Theory, 55(9), 4316\u20134336.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5190_CR9","doi-asserted-by":"crossref","unstructured":"Cl\u00e9men\u00e7on, S., & Vayatis, N. (2010). Overlaying classifiers: a practical approach for optimal scoring. Constructive Approximation. doi: 10.1007\/s00365-010-9084-9","DOI":"10.1007\/s00365-010-9084-9"},{"key":"5190_CR10","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/11503415_1","volume-title":"Proceedings of COLT 2005","author":"S. Cl\u00e9men\u00e7on","year":"2005","unstructured":"Cl\u00e9men\u00e7on, S., Lugosi, G., & Vayatis, N. (2005). Ranking and scoring using empirical risk minimization. In P. Auer, & R. Meir (Eds.), Lecture notes in computer science : Vol. 3559. Proceedings of COLT 2005 (pp. 1\u201315). Berlin: Springer."},{"issue":"2","key":"5190_CR11","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. The Annals of Statistics, 36(2), 844\u2013874.","journal-title":"The Annals of Statistics"},{"key":"5190_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0711-5","volume-title":"A probabilistic theory of pattern recognition","author":"L. Devroye","year":"1996","unstructured":"Devroye, L., Gy\u00f6rfi, L., & Lugosi, G. (1996). A probabilistic theory of pattern recognition. Berlin: Springer."},{"key":"5190_CR13","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-3-540-39857-8_13","volume-title":"Proceedings of the 14th European conference on machine learning (ECML 2003)","author":"C. Ferri","year":"2003","unstructured":"Ferri, C., Flach, P., & Hern\u00e1ndez-Orallo, J. (2003). Improving the AUC of probabilistic estimation trees. In N.\u00a0Lavrac, D. Gamberger, L. Todorovski, & H. Blockeel (Eds.), Proceedings of the 14th European conference on machine learning (ECML 2003), Cavtat-Dubrovnik, Croatia (pp. 121\u2013132). Berlin: Springer."},{"key":"5190_CR14","first-page":"575","volume-title":"Proceedings of the 18th European conference on machine learning","author":"P. Flach","year":"2007","unstructured":"Flach, P., & Matsubara, E. T. (2007). A simple lexicographic ranker and probability estimator. In J. N. Kok, J.\u00a0Koronacki, R. L. de Mantaras, S. Matwin, D. Mladenic, & A. Skowron (Eds.), Proceedings of the 18th European conference on machine learning (pp. 575\u2013582). Berlin: Springer."},{"key":"5190_CR15","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1162\/jmlr.2003.4.6.933","volume":"4","author":"Y. Freund","year":"2003","unstructured":"Freund, Y., Iyer, R. D., Schapire, R. E., & 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":"5190_CR16","unstructured":"Friedman, J. (1996). Local learning based on recursive covering. Tech. Report, Dept. of Statistics, Stanford University, Stanford, CA 94305."},{"key":"5190_CR17","first-page":"393","volume":"6","author":"J. Friedman","year":"2001","unstructured":"Friedman, J. (2001). Greedy function approximation: a gradient boosting machine. Annals of Statistics, 6, 393\u2013425. IMS Reitz Lecture, 1999.","journal-title":"Annals of Statistics"},{"key":"5190_CR18","volume-title":"Generalized linear models","author":"T. Hastie","year":"1990","unstructured":"Hastie, T., & Tibshirani, R. (1990). Generalized linear models. New York: Chapman & Hall\/CRC."},{"key":"5190_CR19","unstructured":"H\u00fcllermeier, E., & Vanderlooy, S. (2008). An empirical and formal analysis of decision trees for ranking. Technical Report Computer Science Series 56. Philipps Universit\u00e4t Marburg."},{"issue":"6","key":"5190_CR20","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1109\/TFUZZ.2009.2026640","volume":"17","author":"E. H\u00fcllermeier","year":"2009","unstructured":"H\u00fcllermeier, E., & Vanderlooy, S. (2009). Why fuzzy decision trees are good rankers. IEEE Transactions on Fuzzy Systems. 17(6), 1233\u20131244.","journal-title":"IEEE Transactions on Fuzzy Systems"},{"key":"5190_CR21","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/775047.775067","volume-title":"KDD\u201902: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining","author":"T. Joachims","year":"2002","unstructured":"Joachims, T. (2002). Optimizing search engines using clickthrough data. In KDD\u201902: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining (pp. 133\u2013142). New York: ACM."},{"issue":"1","key":"5190_CR22","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/18.481777","volume":"42","author":"G. Lugosi","year":"1996","unstructured":"Lugosi, G., & Zeger, K. (1996). Concept learning using complexity regularization. IEEE Transactions on Information Theory, 42(1), 48\u201354.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5190_CR23","volume-title":"A wavelet tour of signal processing","author":"S. Mallat","year":"1990","unstructured":"Mallat, S. (1990). A wavelet tour of signal processing. San Diego: Academic Press."},{"key":"5190_CR24","series-title":"Lecture notes in mathematics","volume-title":"Concentration inequalities and model selection","author":"P. Massart","year":"2006","unstructured":"Massart, P. (2006). Concentration inequalities and model selection. Lecture notes in mathematics. Berlin: Springer."},{"issue":"8","key":"5190_CR25","doi-asserted-by":"crossref","first-page":"2362","DOI":"10.1109\/TIT.2002.800482","volume":"48","author":"A. Nobel","year":"2002","unstructured":"Nobel, A. (2002). Analysis of a complexity-based pruning scheme for classification trees. IEEE Transactions on Information Theory, 48(8), 2362\u20132368.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5190_CR26","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.\u00a027\u201333)."},{"issue":"3","key":"5190_CR27","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1024099825458","volume":"52","author":"F. Provost","year":"2003","unstructured":"Provost, F., & Domingos, P. (2003). Tree induction for probability-based ranking. Machine Learning, 52(3), 199\u2013215.","journal-title":"Machine Learning"},{"key":"5190_CR28","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511812651","volume-title":"Pattern recognition and neural networks","author":"B. Ripley","year":"1996","unstructured":"Ripley, B. (1996). Pattern recognition and neural networks. Cambridge: Cambridge University Press."},{"key":"5190_CR29","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316481","volume-title":"Approximation theorems of mathematical statistics","author":"R. Serfling","year":"1980","unstructured":"Serfling, R. (1980). Approximation theorems of mathematical statistics. New York: Wiley."},{"issue":"1","key":"5190_CR30","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1214\/aos\/1079120131","volume":"32","author":"A. Tsybakov","year":"2004","unstructured":"Tsybakov, A. (2004). Optimal aggregation of classifiers in statistical learning. Annals of Statistics, 32(1), 135\u2013166.","journal-title":"Annals of Statistics"},{"key":"5190_CR31","unstructured":"Yu, P., Wan, W., & Lee, P. (2008). Analyzing ranking data using decision tree. In Proceedings of the EMCL\/PKDD\u201908 workshop on preference learning."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5190-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-010-5190-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5190-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:40:29Z","timestamp":1559353229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-010-5190-y"}},"subtitle":["How to grow and prune a ranking tree"],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["5190"],"URL":"https:\/\/doi.org\/10.1007\/s10994-010-5190-y","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,5]]}}}