{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:45:31Z","timestamp":1760708731112,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662448472"},{"type":"electronic","value":"9783662448489"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44848-9_21","type":"book-chapter","created":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T05:42:21Z","timestamp":1409550141000},"page":"323-337","source":"Crossref","is-referenced-by-count":7,"title":["Cautious Ordinal Classification by Binary Decomposition"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Destercke","sequence":"first","affiliation":[]},{"given":"Gen","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-87479-9_21","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"J. Alonso","year":"2008","unstructured":"Alonso, J., del Coz, J.J., D\u00edez, J., Luaces, O., Bahamonde, A.: Learning to predict one or more ranks in ordinal regression tasks. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008, Part I. LNCS (LNAI), vol.\u00a05211, pp. 39\u201354. Springer, Heidelberg (2008)"},{"key":"21_CR2","first-page":"1823","volume":"9","author":"P. Bartlett","year":"2008","unstructured":"Bartlett, P., Wegkamp, M.: Classification with a reject option using a hinge loss. The Journal of Machine Learning Research\u00a09, 1823\u20131840 (2008)","journal-title":"The Journal of Machine Learning Research"},{"key":"21_CR3","unstructured":"Bengio, S., Weston, J., Grangier, D.: Label embedding trees for large multi-class tasks. In: NIPS, vol.\u00a023, p. 3 (2010)"},{"issue":"2","key":"21_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.ijar.2004.10.002","volume":"39","author":"J. Bernard","year":"2005","unstructured":"Bernard, J.: An introduction to the imprecise dirichlet model for multinomial data. International Journal of Approximate Reasoning\u00a039(2), 123\u2013150 (2005)","journal-title":"International Journal of Approximate Reasoning"},{"key":"21_CR5","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 25 (NIPS 2012), pp. 2510\u20132518 (2012)"},{"key":"21_CR6","unstructured":"Cheng, W., H\u00fcllermeier, E.: A nearest neighbor approach to label ranking based on generalized labelwise loss minimization"},{"key":"21_CR7","unstructured":"Cheng, W., H\u00fcllermeier, E., Dembczynski, K.J.: Graded multilabel classification: The ordinal case. In: Proceedings of the 27th International Conference on Machine Learning (ICML 2010), pp. 223\u2013230 (2010)"},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/TIT.1970.1054406","volume":"16","author":"C. Chow","year":"1970","unstructured":"Chow, C.: On optimum recognition error and reject tradeoff. IEEE Transactions on Information Theory\u00a016(1), 41\u201346 (1970)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1162\/neco.2007.19.3.792","volume":"19","author":"W. Chu","year":"2007","unstructured":"Chu, W., Keerthi, S.S.: Support vector ordinal regression. Neural Computation\u00a019(3), 792\u2013815 (2007)","journal-title":"Neural Computation"},{"key":"21_CR10","series-title":"ISRL","doi-asserted-by":"crossref","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. ISRL, vol.\u00a023, pp. 49\u201393. Springer, Heidelberg (2012)"},{"key":"21_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-540-87479-9_35","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"G. Corani","year":"2008","unstructured":"Corani, G., Zaffalon, M.: Credal model averaging: an extension of bayesian model averaging to imprecise probabilities. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008, Part I. LNCS (LNAI), vol.\u00a05211, pp. 257\u2013271. Springer, Heidelberg (2008)"},{"key":"21_CR12","first-page":"2273","volume":"10","author":"J. Jos\u00e9 del Coz","year":"2009","unstructured":"Jos\u00e9 del Coz, J., Bahamonde, A.: Learning nondeterministic classifiers. The Journal of Machine Learning Research\u00a010, 2273\u20132293 (2009)","journal-title":"The Journal of Machine Learning Research"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"De Cooman, G., Hermans, F.: Imprecise probability trees: Bridging two theories of imprecise probability, vol. 172, pp. 1400\u20131427","DOI":"10.1016\/j.artint.2008.03.001"},{"issue":"2","key":"21_CR14","doi-asserted-by":"crossref","first-page":"163","DOI":"10.3233\/FI-2009-124","volume":"94","author":"K. Dembczy\u0144ski","year":"2009","unstructured":"Dembczy\u0144ski, K., Kot\u0142owski, W., S\u0142owi\u0144ski, R.: Learning rule ensembles for ordinal classification with monotonicity constraints. Fundamenta Informaticae\u00a094(2), 163\u2013178 (2009)","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"21_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. Approx. Reasoning\u00a049(3), 649\u2013663 (2008)","journal-title":"Int. J. Approx. Reasoning"},{"key":"21_CR16","unstructured":"Frank, A., Asuncion, A.: UCI machine learning repository (2010), http:\/\/archive.ics.uci.edu\/ml"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Frank, E., Kramer, S.: Ensembles of nested dichotomies for multi-class problems. In: ICML 2004, p. 39 (2004)","DOI":"10.1145\/1015330.1015363"},{"key":"21_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","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: Flach, P.A., De Raedt, L. (eds.) ECML 2001. LNCS (LNAI), vol.\u00a02167, pp. 145\u2013156. Springer, Heidelberg (2001)"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Frank, E., Kramer, S.: Ensembles of nested dichotomies for multi-class problems. In: Proceedings of the Twenty-first International Conference on Machine Learning, p. 39. ACM (2004)","DOI":"10.1145\/1015330.1015363"},{"key":"21_CR20","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-642-04180-8_41","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"J. F\u00fcrnkranz","year":"2009","unstructured":"F\u00fcrnkranz, J., H\u00fcllermeier, E., Vanderlooy, S.: Binary decomposition methods for multipartite ranking. In: Buntine, W., Grobelnik, M., Mladeni\u0107, D., Shawe-Taylor, J. (eds.) ECML PKDD 2009, Part I. LNCS (LNAI), vol.\u00a05781, pp. 359\u2013374. Springer, Heidelberg (2009)"},{"issue":"6","key":"21_CR21","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/34.601248","volume":"19","author":"T.M. Ha","year":"1997","unstructured":"Ha, T.M.: The optimum class-selective rejection rule. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a019(6), 608\u2013615 (1997)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Herbrich, R., Graepel, T., Obermayer, K.: Large margin rank boundaries for ordinal regression. In: Advances in Neural Information Processing Systems, pp. 115\u2013132 (1999)","DOI":"10.7551\/mitpress\/1113.003.0010"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Training linear svms in linear time. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 217\u2013226. ACM (2006)","DOI":"10.1145\/1150402.1150429"},{"issue":"11","key":"21_CR24","doi-asserted-by":"publisher","first-page":"2576","DOI":"10.1109\/TKDE.2012.204","volume":"25","author":"W. Kotlowski","year":"2013","unstructured":"Kotlowski, W., Slowinski, R.: On nonparametric ordinal classification with monotonicity constraints. IEEE Trans. Knowl. Data Eng.\u00a025(11), 2576\u20132589 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"21_CR25","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 (2006)","DOI":"10.7551\/mitpress\/7503.003.0113"},{"key":"21_CR26","unstructured":"Shashua, A., Levin, A.: Ranking with large margin principle: Two approaches. In: Advances in Neural Information Processing Systems, pp. 937\u2013944 (2002)"},{"key":"21_CR27","series-title":"SCI","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-29694-9_6","volume-title":"Artificial Intelligence, Evolutionary Computing and Metaheuristics","author":"R. Sousa","year":"2013","unstructured":"Sousa, R., Yevseyeva, I., da Costa, J.F.P., Cardoso, J.S.: Multicriteria models for learning ordinal data: A literature review. In: Yang, X.-S. (ed.) Artificial Intelligence, Evolutionary Computing and Metaheuristics. SCI, vol.\u00a0427, pp. 109\u2013138. Springer, Heidelberg (2013)"},{"issue":"6","key":"21_CR28","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1109\/TFUZZ.2012.2196050","volume":"20","author":"A.F. Tehrani","year":"2012","unstructured":"Tehrani, A.F., Cheng, W., H\u00fcllermeier, E.: Preference learning using the choquet integral: The case of multipartite ranking. IEEE T. Fuzzy Systems\u00a020(6), 1102\u20131113 (2012)","journal-title":"IEEE T. Fuzzy Systems"},{"key":"21_CR29","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ijar.2006.06.001","volume":"45","author":"M. Troffaes","year":"2007","unstructured":"Troffaes, M.: Decision making under uncertainty using imprecise probabilities. Int. J. of Approximate Reasoning\u00a045, 17\u201329 (2007)","journal-title":"Int. J. of Approximate Reasoning"},{"key":"21_CR30","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)"},{"key":"21_CR31","doi-asserted-by":"crossref","unstructured":"Walley, P.: Inferences from multinomial data: learning about a bag of marbles. Journal of the Royal Statistical Society. Series B (Methodological), 3\u201357 (1996)","DOI":"10.1111\/j.2517-6161.1996.tb02065.x"},{"key":"21_CR32","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0378-3758(01)00206-3","volume":"105","author":"M. Zaffalon","year":"2002","unstructured":"Zaffalon, M.: The naive credal classifier. J. Probabilistic Planning and Inference\u00a0105, 105\u2013122 (2002)","journal-title":"J. Probabilistic Planning and Inference"},{"key":"21_CR33","doi-asserted-by":"crossref","unstructured":"Zaffalon, M., Corani, G., Mau\u00e1, D.: Evaluating credal classifiers by utility-discounted predictive accuracy. International Journal of Approximate Reasoning (2012)","DOI":"10.1016\/j.ijar.2012.06.022"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44848-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,2]],"date-time":"2024-06-02T04:09:13Z","timestamp":1717301353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44848-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662448472","9783662448489"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44848-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}