{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T18:30:12Z","timestamp":1768069812282,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2010,4,29]],"date-time":"2010-04-29T00:00:00Z","timestamp":1272499200000},"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":[[2010,9]]},"DOI":"10.1007\/s10994-010-5176-9","type":"journal-article","created":{"date-parts":[[2010,4,28]],"date-time":"2010-04-28T20:17:39Z","timestamp":1272485859000},"page":"189-211","source":"Crossref","is-referenced-by-count":11,"title":["Preference-based learning to rank"],"prefix":"10.1007","volume":"80","author":[{"given":"Nir","family":"Ailon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehryar","family":"Mohri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,4,29]]},"reference":[{"key":"5176_CR1","first-page":"393","volume":"6","author":"S. Agarwal","year":"2005","unstructured":"Agarwal, S., Graepel, T., Herbrich, R., Har-Peled, S., & Roth, D. (2005). Generalization bounds for the area under the roc curve. Journal of Machine Learning Research, 6, 393\u2013425.","journal-title":"Journal of Machine Learning Research"},{"key":"5176_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, S., & Niyogi, P. (2005). Stability and generalization of bipartite ranking algorithms. In COLT (pp.\u00a032\u201347).","DOI":"10.1007\/11503415_3"},{"key":"5176_CR3","unstructured":"Ailon, N. (2007). Aggregation of partial rankings, p-ratings and top-m lists. In SODA."},{"key":"5176_CR4","first-page":"684","volume-title":"Proceedings of the 37th annual ACM symposium on theory of computing","author":"N. Ailon","year":"2005","unstructured":"Ailon, N., Charikar, M., & Newman, A. (2005). Aggregating inconsistent information: ranking and clustering. In Proceedings of the 37th annual ACM symposium on theory of computing (pp. 684\u2013693). Baltimore, MD, USA, May 22\u201324, 2005. New York: ACM."},{"key":"5176_CR5","volume-title":"Proceedings of the 21st annual conference on learning theory (COLT 2008)","author":"N. Ailon","year":"2008","unstructured":"Ailon, N., & Mohri, M. (2008). An efficient reduction of ranking to classification. In Proceedings of the 21st annual conference on learning theory (COLT 2008). Helsinki: Omnipress."},{"key":"5176_CR6","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 Discrete Mathematics, 20, 137\u2013142.","journal-title":"SIAM Journal Discrete Mathematics"},{"key":"5176_CR7","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1162\/00335530360535153","volume":"118","author":"D. Ariely","year":"2008","unstructured":"Ariely, D., Loewenstein, G., & Prelec, D. (2008). Coherent arbitrariness: stable demand curves without stable preferences. The Quarterly Journal of Economics, 118, 73\u2013105.","journal-title":"The Quarterly Journal of Economics"},{"key":"5176_CR8","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1086\/256963","volume":"58","author":"K. J. Arrow","year":"1950","unstructured":"Arrow, K. J. (1950). A difficulty in the concept of social welfare. Journal of Political Economy, 58, 328\u2013346.","journal-title":"Journal of Political Economy"},{"key":"5176_CR9","first-page":"604","volume-title":"COLT","author":"M.-F. Balcan","year":"2007","unstructured":"Balcan, M.-F., Bansal, N., Beygelzimer, A., Coppersmith, D., Langford, J., & Sorkin, G. B. (2007). Robust reductions from ranking to classification. In COLT (pp. 604\u2013619). Berlin: Springer."},{"key":"5176_CR10","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s10994-008-5058-6","volume":"72","author":"M.-F. Balcan","year":"2008","unstructured":"Balcan, M.-F., Bansal, N., Beygelzimer, A., Coppersmith, D., Langford, J., & Sorkin, G. B. (2008). Robust reductions from ranking to classification. Machine Learning Journal, 72, 139\u2013153.","journal-title":"Machine Learning Journal"},{"key":"5176_CR11","first-page":"2671","volume":"8","author":"S. Cl\u00e9men\u00e7on","year":"2007","unstructured":"Cl\u00e9men\u00e7on, S., & Vayatis, N. (2007). Ranking the best instances. Journal of Machine Learning Research, 8, 2671\u20132699.","journal-title":"Journal of Machine Learning Research"},{"key":"5176_CR12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1613\/jair.587","volume":"10","author":"W. W. Cohen","year":"1999","unstructured":"Cohen, W. W., Schapire, R. E., & Singer, Y. (1999). Learning to order things. The Journal of Artificial Intelligence Research, 10, 243\u2013270.","journal-title":"The Journal of Artificial Intelligence Research"},{"key":"5176_CR13","doi-asserted-by":"crossref","unstructured":"Coppersmith, D., Fleischer, L., & Rudra, A. (2006). Ordering by weighted number of wins gives a good ranking for weighted tournaments. In Proceedings of the 17th annual ACM-SIAM symposium on discrete algorithms (SODA).","DOI":"10.1145\/1109557.1109642"},{"key":"5176_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-540-72845-0_1","volume-title":"Proceedings of the 6th workshop on experimental algorithms","author":"C. Cortes","year":"2007","unstructured":"Cortes, C., Mohri, M., & Rastogi, A. (2007a). An alternative ranking problem for search engines. In Proceedings of the 6th workshop on experimental algorithms (WEA 2007) (pp. 1\u201321). Heidelberg: Springer-Verlag."},{"key":"5176_CR15","doi-asserted-by":"crossref","unstructured":"Cortes, C., Mohri, M., & Rastogi, A. (2007b). Magnitude-preserving ranking algorithms. In Proceedings of the twenty-fourth international conference on machine learning (ICML 2007). Oregon State University, Corvallis, OR.","DOI":"10.1145\/1273496.1273518"},{"key":"5176_CR16","doi-asserted-by":"crossref","unstructured":"Cossock, D., & Zhang, T. (2006). Subset ranking using regression. In COLT (pp. 605\u2013619).","DOI":"10.1007\/11776420_44"},{"key":"5176_CR17","series-title":"Neural information processing systems: natural and synthetic, NIPS 2001","first-page":"641","volume-title":"Advances in neural information processing systems","author":"K. Crammer","year":"2001","unstructured":"Crammer, K., & Singer, Y. (2001). Pranking with ranking. In Advances in neural information processing systems : Vol. 14. Neural information processing systems: natural and synthetic, NIPS 2001 (pp. 641\u2013647). Vancouver, British Columbia, Canada, December 3\u20138, 2001. Cambridge: MIT Press."},{"key":"5176_CR18","first-page":"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":"5176_CR19","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1148\/radiology.143.1.7063747","volume":"143","author":"J. A. Hanley","year":"1982","unstructured":"Hanley, J. A., & McNeil, B. J. (1982). The meaning and use of the area under a receiver operating characteristic (ROC) curve. Radiology, 143, 29\u201336.","journal-title":"Radiology"},{"key":"5176_CR20","unstructured":"Hedge, R., Jain, K., Williamson, D. P., & van Zuylen, A. (2007). Deterministic pivoting algorithms for constrained ranking and clustering problems. In Proceedings of the ACM-SIAM symposium on discrete algorithms (SODA)."},{"key":"5176_CR21","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/366622.366644","volume":"4","author":"C. Hoare","year":"1961","unstructured":"Hoare, C. (1961). Quicksort: Algorithm 64. Communications of the ACM, 4, 321\u2013322.","journal-title":"Communications of the ACM"},{"key":"5176_CR22","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 Press."},{"key":"5176_CR23","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/1250790.1250806","volume-title":"STOC \u201907: Proceedings of the thirty-ninth annual ACM symposium on theory of computing","author":"C. Kenyon-Mathieu","year":"2007","unstructured":"Kenyon-Mathieu, C., & Schudy, W. (2007). How to rank with few errors. In STOC \u201907: Proceedings of the thirty-ninth annual ACM symposium on theory of computing (pp. 95\u2013103). New York: ACM Press."},{"key":"5176_CR24","volume-title":"Nonparametrics: statistical methods based on ranks","author":"E. L. Lehmann","year":"1975","unstructured":"Lehmann, E. L. (1975). Nonparametrics: statistical methods based on ranks. San Francisco: Holden-Day."},{"key":"5176_CR25","first-page":"538","volume-title":"Proceedings of the 2002 ACM CIKM international conference on information and knowledge management","author":"M. H. Montague","year":"2002","unstructured":"Montague, M. H., & Aslam, J. A. (2002). Condorcet fusion for improved retrieval. In Proceedings of the 2002 ACM CIKM international conference on information and knowledge management (pp. 538\u2013548). McLean, VA, USA, November 4\u20139, 2002. New York: ACM."},{"key":"5176_CR26","first-page":"63","volume-title":"Learning theory, 18th annual conference on learning theory, COLT 2005 Proceedings","author":"C. Rudin","year":"2005","unstructured":"Rudin, C., Cortes, C., Mohri, M., & Schapire, R. E. (2005). Margin-based ranking meets boosting in the middle. In Learning theory, 18th annual conference on learning theory, COLT 2005 Proceedings (pp.\u00a063\u201378). Bertinoro, Italy, June 27\u201330, 2005. Berlin: Springer."},{"key":"5176_CR27","unstructured":"Williamson, D. P., & van Zuylen, A. (2007). Deterministic algorithms for rank aggregation and other ranking and clustering problems. In Proceedings of the 5th workshop on approximation and online algorithms (WAOA)."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5176-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-010-5176-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5176-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:40:28Z","timestamp":1559353228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-010-5176-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,29]]},"references-count":27,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["5176"],"URL":"https:\/\/doi.org\/10.1007\/s10994-010-5176-9","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,29]]}}}