{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:14:32Z","timestamp":1743063272830,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030501426"},{"type":"electronic","value":"9783030501433"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-50143-3_8","type":"book-chapter","created":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T21:03:01Z","timestamp":1591390981000},"page":"96-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Cautious Label-Wise Ranking with Constraint Satisfaction"],"prefix":"10.1007","author":[{"given":"Yonatan-Carlos","family":"Carranza-Alarcon","sequence":"first","affiliation":[]},{"given":"Soundouss","family":"Messoudi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2026-468X","authenticated-orcid":false,"given":"S\u00e9bastien","family":"Destercke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,5]]},"reference":[{"key":"8_CR1","unstructured":"Andersen, M., Dahl, J., Vandenberghe, L.: CVXOPT: a python package for convex optimization (2013). http:\/\/abel.ee.ucla.edu\/cvxopt"},{"key":"8_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/9781118763117","volume-title":"Introduction to Imprecise Probabilities","author":"T Augustin","year":"2014","unstructured":"Augustin, T., Coolen, F., de Cooman, G., Troffaes, M.: Introduction to Imprecise Probabilities. Wiley, Chichester (2014)"},{"key":"8_CR3","unstructured":"Balz, A., Senge, R.: WEKA-LR: a label ranking extension for weka (2011). https:\/\/cs.uni-paderborn.de\/de\/is\/research\/research-projects\/software\/weka-lr-a-label-ranking-extension-for-weka\/"},{"key":"8_CR4","first-page":"1823","volume":"9","author":"P Bartlett","year":"2008","unstructured":"Bartlett, P., Wegkamp, M.: Classification with a reject option using a hinge loss. J. Mach. Learn. Res. 9, 1823\u20131840 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"8_CR5","first-page":"127","volume":"22","author":"A Bordes","year":"2012","unstructured":"Bordes, A., Glorot, X., Weston, J., Bengio, Y.: Joint learning of words and meaning representations for open-text semantic parsing. J. Mach. Learn. Res. Proc. Track 22, 127\u2013135 (2012)","journal-title":"J. Mach. Learn. Res. Proc. Track"},{"key":"8_CR6","unstructured":"Carranza-Alarcon, Y.C., Destercke, S.: Imprecise gaussian discriminant classification. In: International Symposium on Imprecise Probabilities: Theories and Applications, pp. 59\u201367 (2019)"},{"key":"8_CR7","unstructured":"Cheng, W., Dembczynski, K., H\u00fcllermeier, E.: Label ranking methods based on the Plackett-Luce model. In: Proceedings of the 27th Annual International Conference on Machine Learning - ICML, pp. 215\u2013222 (2010)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Cheng, W., H\u00fchn, J., H\u00fcllermeier, E.: Decision tree and instance-based learning for label ranking. In: Proceedings of the 26th Annual International Conference on Machine Learning - ICML 2009 (2009)","DOI":"10.1145\/1553374.1553395"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-15880-3_20","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"W Cheng","year":"2010","unstructured":"Cheng, W., Rademaker, M., De Baets, B., H\u00fcllermeier, E.: Predicting partial orders: ranking with abstention. In: Balc\u00e1zar, J.L., Bonchi, F., Gionis, A., Sebag, M. (eds.) ECML PKDD 2010. LNCS (LNAI), vol. 6321, pp. 215\u2013230. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15880-3_20"},{"key":"8_CR10","unstructured":"Cheng, W., H\u00fcllermeier, E., Waegeman, W., Welker, V.: Label ranking with partial abstention based on thresholded probabilistic models. In: Advances in Neural Information Processing Systems, pp. 2501\u20132509 (2012)"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-23166-7_4","volume-title":"Data Mining: Foundations and Intelligent Paradigms","author":"G Corani","year":"2012","unstructured":"Corani, G., Antonucci, A., Zaffalon, M.: Bayesian networks with imprecise probabilities: theory and application to classification. In: Holmes, D.E., Jain, L.C. (eds.) Data Mining: Foundations and Intelligent Paradigms, pp. 49\u201393. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-23166-7_4"},{"key":"8_CR12","volume-title":"Constraint Processing","author":"R Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Mateo (2003)"},{"key":"8_CR13","unstructured":"Dekel, O., Manning, C.D., Singer, Y.: Log-linear models for label ranking. In: Advances in Neural Information Processing Systems (2003)"},{"key":"8_CR14","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/j.ijar.2008.07.003","volume":"49","author":"S Destercke","year":"2008","unstructured":"Destercke, S., Dubois, D., Chojnacki, E.: Unifying practical uncertainty representations: I. Generalized p-boxes. Int. J. Approximate Reasoning 49, 649\u2013663 (2008)","journal-title":"Int. J. Approximate Reasoning"},{"issue":"2","key":"8_CR16","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10479-016-2253-x","volume":"256","author":"S Destercke","year":"2016","unstructured":"Destercke, S.: On the median in imprecise ordinal problems. Ann. Oper. Res. 256(2), 375\u2013392 (2016). https:\/\/doi.org\/10.1007\/s10479-016-2253-x","journal-title":"Ann. Oper. Res."},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Destercke, S., Dubois, D.: Special cases. In: Introduction to Imprecise Probabilities, pp. 79\u201392 (2014)","DOI":"10.1002\/9781118763117.ch4"},{"issue":"3","key":"8_CR18","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/j.ejor.2015.05.005","volume":"246","author":"S Destercke","year":"2015","unstructured":"Destercke, S., Masson, M.H., Poss, M.: Cautious label ranking with label-wise decomposition. Eur. J. Oper. Res. 246(3), 927\u2013935 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-662-44848-9_21","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"S Destercke","year":"2014","unstructured":"Destercke, S., Yang, G.: Cautious ordinal classification by binary decomposition. In: Calders, T., Esposito, F., H\u00fcllermeier, E., Meo, R. (eds.) ECML PKDD 2014. LNCS (LNAI), vol. 8724, pp. 323\u2013337. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44848-9_21"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Elisseeff, A., Weston, J.: Kernel methods for multi-labelled classification and categorical regression problems. In: Advances in Neural Information Processing Systems, pp. 681\u2013687. MIT Press, Cambridge (2002)","DOI":"10.7551\/mitpress\/1120.003.0092"},{"key":"8_CR21","unstructured":"Frank, A., Asuncion, A.: UCI machine learning repository (2010). http:\/\/archive.ics.uci.edu\/ml"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-44795-4_13","volume-title":"Machine Learning: ECML 2001","author":"E Frank","year":"2001","unstructured":"Frank, E., Hall, M.: A simple approach to ordinal classification. In: De Raedt, L., Flach, P. (eds.) ECML 2001. LNCS (LNAI), vol. 2167, pp. 145\u2013156. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44795-4_13"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Geng, X.: Multilabel ranking with inconsistent rankers. In: Proceedings of CVPR 2014 (2014)","DOI":"10.1109\/CVPR.2014.478"},{"key":"8_CR24","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., Furnkranz, J., Cheng, W., Brinker, K.: Label ranking by learning pairwise preferences. Artif. Intell. 172, 1897\u20131916 (2008)","journal-title":"Artif. Intell."},{"issue":"3","key":"8_CR25","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1080\/08839519508945477","volume":"9","author":"R King","year":"1995","unstructured":"King, R., Feng, C., Sutherland, A.: StatLog: comparison of classification algorithms on large real-world problems. App. Artif. Intell. 9(3), 289\u2013333 (1995)","journal-title":"App. Artif. Intell."},{"key":"8_CR26","unstructured":"Lacoste-Julien, S.: Convergence rate of Frank-Wolfe for non-convex objectives. arXiv preprint arXiv:1607.00345 (2016)"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Li, L., Lin, H.T.: Ordinal regression by extended binary classification. In: Advances in Neural Information Processing Systems, pp. 865\u2013872 (2007)","DOI":"10.7551\/mitpress\/7503.003.0113"},{"key":"8_CR28","unstructured":"L\u00f3pez-Ortiz, A., Quimper, C.G., Tromp, J., Van Beek, P.: A fast and simple algorithm for bounds consistency of the all different constraint. In: IJCAI, vol. 3, pp. 245\u2013250 (2003)"},{"issue":"1","key":"8_CR29","doi-asserted-by":"publisher","first-page":"211","DOI":"10.3150\/10-BEJ267","volume":"17","author":"I Steinwart","year":"2011","unstructured":"Steinwart, I., Christmann, A., et al.: Estimating conditional quantiles with the help of the pinball loss. Bernoulli 17(1), 211\u2013225 (2011)","journal-title":"Bernoulli"},{"key":"8_CR30","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-14125-6_3","volume-title":"Preference Learning","author":"S Vembu","year":"2010","unstructured":"Vembu, S., G\u00e4rtner, T.: Label ranking algorithms: a survey. In: F\u00fcrnkranz, J., H\u00fcllermeier, E. (eds.) Preference Learning, pp. 45\u201364. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14125-6_3"},{"key":"8_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-3472-7","volume-title":"Statistical Reasoning with Imprecise Probabilities","author":"P Walley","year":"1991","unstructured":"Walley, P.: Statistical Reasoning with Imprecise Probabilities. Chapman and Hall, New York (1991)"},{"issue":"1","key":"8_CR32","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1111\/j.2517-6161.1996.tb02065.x","volume":"58","author":"P Walley","year":"1996","unstructured":"Walley, P.: Inferences from multinomial data: learning about a bag of marbles. J. Roy. Stat. Soc.: Ser. B (Methodol.) 58(1), 3\u201334 (1996)","journal-title":"J. Roy. Stat. Soc.: Ser. B (Methodol.)"},{"issue":"2","key":"8_CR33","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1109\/TCBB.2007.358301","volume":"4","author":"N Weskamp","year":"2007","unstructured":"Weskamp, N., Hullermeier, E., Kuhn, D., Klebe, G.: Multiple graph alignment for the structural analysis of protein active sites. IEEE\/ACM Trans. Comput. Biol. Bioinf. 4(2), 310\u2013320 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"12","key":"8_CR34","doi-asserted-by":"publisher","first-page":"4316","DOI":"10.1109\/TCYB.2016.2607237","volume":"47","author":"G Yang","year":"2016","unstructured":"Yang, G., Destercke, S., Masson, M.H.: The costs of indeterminacy: how to determine them? IEEE Trans. Cybern. 47(12), 4316\u20134327 (2016)","journal-title":"IEEE Trans. Cybern."},{"issue":"1","key":"8_CR35","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0378-3758(01)00201-4","volume":"105","author":"M Zaffalon","year":"2002","unstructured":"Zaffalon, M.: The naive credal classifier. J. Stat. Plann. Infer. 105(1), 5\u201321 (2002)","journal-title":"J. Stat. Plann. Infer."},{"issue":"8","key":"8_CR36","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1016\/j.ijar.2012.06.022","volume":"53","author":"M Zaffalon","year":"2012","unstructured":"Zaffalon, M., Corani, G., Mau\u00e1, D.: Evaluating credal classifiers by utility-discounted predictive accuracy. Int. J. Approximate Reasoning 53(8), 1282\u20131301 (2012)","journal-title":"Int. J. Approximate Reasoning"}],"container-title":["Communications in Computer and Information Science","Information Processing and Management of Uncertainty in Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50143-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T01:26:57Z","timestamp":1722994017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50143-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030501426","9783030501433"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50143-3_8","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"5 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPMU","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipmu2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipmu2020.inesc-id.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"213","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The IPMU 2020 was held virtually due to the coronavirus pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}