{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:05:23Z","timestamp":1725750323206},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642409349"},{"type":"electronic","value":"9783642409356"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40935-6_2","type":"book-chapter","created":{"date-parts":[[2013,9,27]],"date-time":"2013-09-27T05:14:50Z","timestamp":1380258890000},"page":"13-21","source":"Crossref","is-referenced-by-count":0,"title":["Learning and Optimizing with Preferences"],"prefix":"10.1007","author":[{"given":"Nir","family":"Ailon","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Ailon, N., Begleiter, R., Ezra, E.: Active learning using smooth relative regret approximations with applications. Journal of Machine Learning Research - Proceedings Track 23 (2012)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: Ranking and clustering. J. ACM\u00a055(5) (2008)","DOI":"10.1145\/1411509.1411513"},{"key":"2_CR3","unstructured":"Arrow, K.: Social Choice and Individual Values. Yale University Press (1963)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Balcan, M.-F., Beygelzimer, A., Langford, J.: Agnostic active learning. In: Proceedings of the 23rd International Conference on Machine Learning, ICML 2006, pp. 65\u201372 (2006)","DOI":"10.1145\/1143844.1143853"},{"issue":"2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J. Bartholdi","year":"1989","unstructured":"Bartholdi, J., Tovey, C.A., Trick, M.A.: Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare\u00a06(2), 157\u2013165 (1989)","journal-title":"Social Choice and Welfare"},{"key":"2_CR6","unstructured":"Borda, J.C.: M\u00e9moire sur les \u00e9lections au scrutin. Histoire de l\u2019Acad\u00e9mie Royale des Sciences (1781)"},{"key":"2_CR7","unstructured":"Braverman, M., Mossel, E.: Noisy sorting without resampling. In: SODA 2008: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 268\u2013276 (2008)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-78646-7_5","volume-title":"Advances in Information Retrieval","author":"B. Carterette","year":"2008","unstructured":"Carterette, B., Bennett, P.N., Chickering, D.M., Dumais, S.T.: Here or there: Preference judgments for relevance. In: Macdonald, C., Ounis, I., Plachouras, V., Ruthven, I., White, R.W. (eds.) ECIR 2008. LNCS, vol.\u00a04956, pp. 16\u201327. Springer, Heidelberg (2008)"},{"key":"2_CR9","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.: Learning to order things. J. Artif. Intell. Res. (JAIR)\u00a010, 243\u2013270 (1999)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"2_CR10","unstructured":"Condorcet, M.-J.: \u00c9ssai sur l\u2019application de l\u2019analyse \u00e0 la probabilit\u00e9 des d\u00e9cisions rendues \u00e0 la pluralit\u00e9 des voix. Imprimerie Royal, Paris (1785)"},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1798596.1798608","volume":"6","author":"D. Coppersmith","year":"2010","unstructured":"Coppersmith, D., Fleischer, L.K., Rurda, A.: Ordering by weighted number of wins gives a good ranking for weighted tournaments. ACM Trans. Algorithms\u00a06(3), 1\u201313 (2010)","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"2_CR12","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.2517-6161.1977.tb01624.x","volume":"39","author":"P. Diaconis","year":"1977","unstructured":"Diaconis, P., Graham, R.: Spearman\u2019s footrule as a measure of disarray. Journal of the Royal Statistical Society, Series B\u00a039(2), 262\u2013268 (1977)","journal-title":"Journal of the Royal Statistical Society, Series B"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings of the Tenth International Conference on the World Wide Web, WWW 2010, Hong Kong, pp. 613\u2013622 (2001)","DOI":"10.1145\/371920.372165"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kumar, R., Mahdian, M., Sivakumar, D., Vee, E.: Comparing and aggregating rankings with ties. In: Proceedings of the Twenty-Third ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 47\u201358 (2004)","DOI":"10.1145\/1055558.1055568"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Fang, Y., Si, L.: A latent pairwise preference learning approach for recommendation from implicit feedback. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, CIKM (2012)","DOI":"10.1145\/2396761.2398693"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Farias, V.F., Jagabathula, S., Shah, D.: Sparse choice models. In: CISS, pp. 1\u201328 (2012)","DOI":"10.1109\/CISS.2012.6310952"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Computing with unreliable information. In: STOC 1990: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pp. 128\u2013137 (1990)","DOI":"10.1145\/100216.100230"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"De Gemmis, M., Iaquinta, L., Lops, P., Musto, C., Narducci, F., Semeraro, G.: Preference learning in recommender systems. In: Preference Learning (PL 2009) ECML\/PKDD 2009 Workshop (2009)","DOI":"10.1007\/978-3-642-14125-6_18"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Hanneke, S.: A bound on the label complexity of agnostic active learning. In: Proceedings of the 24th International Conference on Machine Learning, ICML 2007, pp. 353\u2013360 (2007)","DOI":"10.1145\/1273496.1273541"},{"issue":"16-17","key":"2_CR20","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1016\/j.artint.2008.08.002","volume":"172","author":"E. H\u00fcllermeier","year":"2008","unstructured":"H\u00fcllermeier, E., F\u00fcrnkranz, J., Cheng, W., Brinker, K.: Label ranking by learning pairwise preferences. Artif. Intell.\u00a0172(16-17), 1897\u20131916 (2008)","journal-title":"Artif. Intell."},{"issue":"1","key":"2_CR21","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10107-010-0419-x","volume":"127","author":"X. Jiang","year":"2011","unstructured":"Jiang, X., Lim, L.-H., Yao, Y., Ye, Y.: Statistical ranking and combinatorial hodge theory. Math. Program.\u00a0127(1), 203\u2013244 (2011)","journal-title":"Math. Program."},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Optimizing search engines using clickthrough data. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 133\u2013142 (2002)","DOI":"10.1145\/775066.775067"},{"key":"2_CR23","first-page":"571","volume":"88","author":"J.G. Kemeny","year":"1959","unstructured":"Kemeny, J.G.: Mathematics without numbers. Daedalus\u00a088, 571\u2013591 (1959)","journal-title":"Daedalus"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: STOC, pp. 95\u2013103 (2007)","DOI":"10.1145\/1250790.1250806"},{"key":"2_CR25","unstructured":"Marden, J.I.: Analyzing and Modeling Rank Data. Chapman & Hall (1995)"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Radinsky, K., Ailon, N.: Ranking from pairs and triplets: information quality, evaluation methods and query complexity. In: WSDM, pp. 105\u2013114 (2011)","DOI":"10.1145\/1935826.1935850"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Radlinski, F., Kleinberg, R., Joachims, T.: Learning diverse rankings with multi-armed bandits. In: ICML, pp. 784\u2013791 (2008)","DOI":"10.1145\/1390156.1390255"},{"key":"2_CR28","first-page":"2233","volume":"10","author":"C. Rudin","year":"2009","unstructured":"Rudin, C.: The p-norm push: A simple convex ranking algorithm that concentrates at the top of the list. J. Mach. Learn. Res.\u00a010, 2233\u20132271 (2009)","journal-title":"J. Mach. Learn. Res."},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Train, K.: Discrete Choice Methods with Simulation. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511805271"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40935-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T05:18:54Z","timestamp":1716009534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40935-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642409349","9783642409356"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40935-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}