{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T17:59:17Z","timestamp":1794592757364,"version":"4.9.1"},"publisher-location":"Boston, MA","reference-count":24,"publisher":"Springer US","isbn-type":[{"value":"9781489976857","type":"print"},{"value":"9781489976871","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-1-4899-7687-1_667","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T15:51:54Z","timestamp":1553097114000},"page":"1000-1005","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Preference Learning"],"prefix":"10.1007","author":[{"given":"Johannes","family":"F\u00fcrnkranz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eyke","family":"H\u00fcllermeier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,4,14]]},"reference":[{"key":"667_CR16175","first-page":"135","volume":"21","author":"C Boutilier","year":"2004","unstructured":"Boutilier C, Brafman R, Domshlak C, Hoos H, Poole D (2004) CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements. J AI Res 21:135\u2013191","journal-title":"J AI Res"},{"key":"667_CR16176","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/978-3-319-11662-4_3","volume-title":"Proceedings of ALT, 25th international conference on algorithmic learning theory","author":"R Busa-Fekete","year":"2014","unstructured":"Busa-Fekete R, H\u00fcllermeier E (2014) A survey of preference-based online learning with bandit algorithms. In: Proceedings of ALT, 25th international conference on algorithmic learning theory, Bled. Springer, pp\u00a018\u201339"},{"key":"667_CR16177","doi-asserted-by":"crossref","unstructured":"Cao Z, Qin T, Liu TY, Tsai MF, Li H (2007) Learning to rank: from pairwise approach to listwise approach. In: Proceedings of ICML, 24th international conference on machine learning, pp\u00a0129\u2013136","DOI":"10.1145\/1273496.1273513"},{"key":"667_CR16178","doi-asserted-by":"crossref","unstructured":"Cheng W, H\u00fchn J, H\u00fcllermeier E (2009) Decision tree and instance-based learning for label ranking. In: Proceedings of ICML\u20132009, 26th international conference on machine learning, Montreal, pp\u00a0161\u2013168","DOI":"10.1145\/1553374.1553395"},{"key":"667_CR16179","unstructured":"Cheng W, Dembczynski K, H\u00fcllermeier E (2010) Label ranking based on the Plackett-Luce model. In: Proceedings of ICML\u20132010, international conference on machine learning, Haifa, pp\u00a0215\u2013222"},{"key":"667_CR16180","unstructured":"Cheng W, H\u00fcllermeier E, Waegeman W, Welker V (2012) Label ranking with partial abstention based on thresholded probabilistic models. In: Proceedings of NIPS\u20132012, 26th annual conference on neural information processing systems, Lake Tahoe"},{"issue":"1","key":"667_CR16181","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1613\/jair.587","volume":"10","author":"WW Cohen","year":"1999","unstructured":"Cohen WW, Schapire RE, Singer Y (1999) Learning to order things. J Artif Intell Res 10(1):243\u2013270","journal-title":"J Artif Intell Res"},{"issue":"7\u20138","key":"667_CR16182","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1016\/j.artint.2011.03.004","volume":"175","author":"C Domshlak","year":"2011","unstructured":"Domshlak C, H\u00fcllermeier E, Kaci S, Prade H (2011) Preferences in AI: an overview. Artif Intell 175(7\u20138):1037\u20131052","journal-title":"Artif Intell"},{"key":"667_CR16183","volume-title":"Utility-theory for decision making","author":"PC Fishburn","year":"1969","unstructured":"Fishburn PC (1969) Utility-theory for decision making. Wiley, New York"},{"key":"667_CR16184","volume-title":"Preference learning","year":"2010","unstructured":"F\u00fcrnkranz J, H\u00fcllermeier E (eds) (2010) Preference learning. Springer, Heidelberg\/New York"},{"key":"667_CR16185","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-14125-6_1","volume-title":"Preference learning","author":"J F\u00fcrnkranz","year":"2010","unstructured":"F\u00fcrnkranz J, H\u00fcllermeier E (2010) Preference learning: an introduction. In: Preference learning. Springer, Heidelberg\/New York, pp\u00a01\u201318"},{"key":"667_CR16186","doi-asserted-by":"crossref","unstructured":"F\u00fcrnkranz J, H\u00fcllermeier E, Vanderlooy S (2009) Binary decomposition methods for multipartite ranking. In: Proceedings of ECML\/PKDD\u20132009, European conference on machine learning and knowledge discovery in databases, Bled","DOI":"10.1007\/978-3-642-04180-8_41"},{"key":"667_CR16187","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/3-540-36169-3_29","volume-title":"Proceedings of 13th international conference on algorithmic learning theory","author":"S Har-Peled","year":"2002","unstructured":"Har-Peled S, Roth D, Zimak D (2002) Constraint classification: a new approach to multiclass classification. In: Proceedings of 13th international conference on algorithmic learning theory, L\u00fcbeck. Springer, pp\u00a0365\u2013379"},{"key":"667_CR16188","unstructured":"Herbrich R, Graepel T, Bollmann-Sdorra P, Obermayer K (1998) Supervised learning of preference relations. In: Proceedings des Fachgruppentreffens Maschinelles Lernen (FGML-98), pp\u00a043\u201347"},{"issue":"1","key":"667_CR16189","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.jcss.2009.05.005","volume":"76","author":"E H\u00fcllermeier","year":"2010","unstructured":"H\u00fcllermeier E, F\u00fcrnkranz J (2010) On predictive accuracy and risk minimization in pairwise label ranking. J Comput Syst Sci 76(1):49\u201362","journal-title":"J Comput Syst Sci"},{"key":"667_CR16190","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 (2008) Label ranking by learning pairwise preferences. Artif Intell 172:1897\u20131917","journal-title":"Artif Intell"},{"key":"667_CR16191","doi-asserted-by":"crossref","unstructured":"Joachims T (2002) Optimizing search engines using clickthrough data. In: Proceedings of KDD\u201302, 8th ACM SIGKDD international conference on knowledge discovery and data mining. ACM Press, pp\u00a0133\u2013142","DOI":"10.1145\/775047.775067"},{"key":"667_CR16192","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-14125-6_9","volume-title":"Preference learning","author":"T Kamishima","year":"2010","unstructured":"Kamishima T, Kazawa H, Akaho S (2010) A survey and empirical comparison of object ranking methods. In: F\u00fcrnkranz J, H\u00fcllermeier E (eds) Preference learning. Springer, Heidelberg\/New York, pp\u00a0181\u2013202"},{"key":"667_CR16193","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14267-3","volume-title":"Learning to rank for information retrieval","author":"TY Liu","year":"2011","unstructured":"Liu TY (2011) Learning to rank for information retrieval. Springer, Berlin\/Heidelberg\/New York"},{"key":"667_CR16194","doi-asserted-by":"crossref","unstructured":"Sch\u00e4fer D, H\u00fcllermeier E (2015) Dyad ranking using a bilinear Plackett-Luce model. In: Proceedings of ECML\/PKDD\u20132015, European conference on machine learning and knowledge discovery in databases, Porto","DOI":"10.1007\/978-3-319-23525-7_14"},{"key":"667_CR16195","unstructured":"Tesauro G (1989) Connectionist learning of expert preferences by comparison training. In: Advances in neural information processing systems 1 (NIPS-88). Morgan Kaufmann, pp\u00a099\u2013106"},{"key":"667_CR16196","first-page":"1453","volume":"6","author":"I Tsochantaridis","year":"2005","unstructured":"Tsochantaridis I, Joachims T, Hofmann T, Altun Y (2005) Large margin methods for structured and interdependent output variables. J Mach Learn Res 6:1453\u20131484","journal-title":"J Mach Learn Res"},{"key":"667_CR16197","volume-title":"Preference learning","author":"S Vembu","year":"2010","unstructured":"Vembu S, G\u00e4rtner T (2010) Label ranking: a survey. In: F\u00fcrnkranz J, H\u00fcllermeier E (eds) Preference learning. Springer, Heidelberg\/New York"},{"issue":"3","key":"667_CR16198","first-page":"557","volume":"9","author":"Y Zhou","year":"2014","unstructured":"Zhou Y, Lui Y, Yang J, He X, Liu L (2014) A taxonomy of label ranking algorithms. J Comput 9(3):557","journal-title":"J Comput"}],"container-title":["Encyclopedia of Machine Learning and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4899-7687-1_667","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,12]],"date-time":"2026-10-12T14:46:41Z","timestamp":1791816401000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4899-7687-1_667"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9781489976857","9781489976871"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-1-4899-7687-1_667","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-1-4899-7687-1","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"14 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}