{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:28:27Z","timestamp":1742380107407},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2009,7,23]],"date-time":"2009-07-23T00:00:00Z","timestamp":1248307200000},"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":[[2009,9]]},"DOI":"10.1007\/s10994-009-5132-8","type":"journal-article","created":{"date-parts":[[2009,7,22]],"date-time":"2009-07-22T14:27:25Z","timestamp":1248272845000},"page":"271-285","source":"Crossref","is-referenced-by-count":10,"title":["Cost-sensitive learning based on Bregman divergences"],"prefix":"10.1007","volume":"76","author":[{"given":"Ra\u00fal","family":"Santos-Rodr\u00edguez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alicia","family":"Guerrero-Curieses","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roc\u00edo","family":"Alaiz-Rodr\u00edguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jes\u00fas","family":"Cid-Sueiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,7,23]]},"reference":[{"key":"5132_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1014052.1014056","volume-title":"KDD \u201904: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining","author":"N. Abe","year":"2004","unstructured":"Abe, N., Zadrozny, B., & Langford, J. (2004). An iterative method for multi-class cost-sensitive learning. In KDD \u201904: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 3\u201311). New York: ACM."},{"issue":"7","key":"5132_CR2","doi-asserted-by":"crossref","first-page":"2664","DOI":"10.1109\/TIT.2005.850145","volume":"51","author":"A. Banerjee","year":"2005","unstructured":"Banerjee, A., Guo, X., & Wang, H. (2005). On the optimality of conditional expectation as a Bregman predictor. IEEE Transactions on Information Theory, 51(7), 2664\u20132669.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5132_CR3","first-page":"131","volume-title":"Proceedings of the European conference on machine learning","author":"J. P. Bradford","year":"1998","unstructured":"Bradford, J. P., Kunz, C., Kohavi, R., Brunk, C., & Brodley, C. E. (1998). Pruning decision trees with misclassification costs. In Proceedings of the European conference on machine learning (pp. 131\u2013136). Berlin: Springer."},{"issue":"10","key":"5132_CR4","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"L. M. Bregman","year":"1967","unstructured":"Bregman, L. M. (1967). The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics, 7(10), 200\u2013217.","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"key":"5132_CR5","doi-asserted-by":"crossref","unstructured":"Cid-Sueiro, J., & Figueiras-Vidal, A. R. (2001). On the structure of strict sense Bayesian cost functions and its applications. IEEE Transactions on Neural Networks, 12(3).","DOI":"10.1109\/72.925549"},{"issue":"3","key":"5132_CR6","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/72.761724","volume":"10","author":"J. Cid-Sueiro","year":"1999","unstructured":"Cid-Sueiro, J., Arribas, J. I., Urb\u00e1n-Mu\u00f1oz, S., & Figueiras-Vidal, A. R. (1999). Cost functions to estimate a posteriori probabilities in multi-class problems. IEEE Transactions on Neural Networks, 10(3), 645\u2013656.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"5132_CR7","first-page":"1705","volume":"6","author":"I. S. Dhillon","year":"2005","unstructured":"Dhillon, I. S., Banerjee, A., Merugu, S., & Ghosh, J. (2005). Clustering with Bregman divergences. Journal of Machine Learning Research, 6, 1705\u20131749.","journal-title":"Journal of Machine Learning Research"},{"key":"5132_CR8","first-page":"97","volume-title":"Proc. 16th international conf. on machine learning","author":"W. Fan","year":"1999","unstructured":"Fan, W., Stolfo, S. J., Zhang, J., & Chan, P. K. (1999). Adacost: misclassification cost-sensitive boosting. In Proc. 16th international conf. on machine learning (pp. 97\u2013105). San Mateo: Morgan Kaufmann."},{"issue":"477","key":"5132_CR9","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1198\/016214506000001437","volume":"102","author":"T. Gneiting","year":"2007","unstructured":"Gneiting, T., & Raftery, A. E. (2007). Strictly proper scoring rules, prediction, and estimation. Journal of the American Statistical Association, 102(477), 359\u2013378.","journal-title":"Journal of the American Statistical Association"},{"issue":"2","key":"5132_CR10","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1109\/TNN.2004.824421","volume":"15","author":"A. Guerrero-Curieses","year":"2004","unstructured":"Guerrero-Curieses, A., Cid-Sueiro, J., Alaiz-Rodr\u00edguez, R., & Figueiras, A. (2004). Local estimation of posterior class probabilities to minimize classification errors. IEEE Transactions on Neural Networks, 15(2), 309\u2013317.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"5132_CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.neucom.2005.02.011","volume":"69","author":"A. Guerrero-Curieses","year":"2005","unstructured":"Guerrero-Curieses, A., Alaiz-Rodr\u00edguez, R., & Cid-Sueiro, J. (2005). Loss function to combine learning and decision in multiclass problems. Neurocomputing, 69, 3\u201317.","journal-title":"Neurocomputing"},{"key":"5132_CR12","volume-title":"Entropy optimization principles with applications","author":"J. N. Kapur","year":"1993","unstructured":"Kapur, J. N., & Kesavan, H. K. (1993). Entropy optimization principles with applications. San Diego: Academic Press."},{"key":"5132_CR13","first-page":"445","volume-title":"Proceedings of the 13th European conference on artificial intelligence (ECAI-98)","author":"M. Z. Kukar","year":"1998","unstructured":"Kukar, M. Z., & Kononenko, I. (1998). Cost-sensitive learning with neural networks. In Proceedings of the 13th European conference on artificial intelligence (ECAI-98) (pp. 445\u2013449). New York: Wiley."},{"issue":"1","key":"5132_CR14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/TKDE.2006.17","volume":"18","author":"X. Y. Liu","year":"2006","unstructured":"Liu, X. Y., & Zhou, Z. H. (2006). Training cost-sensitive neural networks with methods addressing the class imbalance problem. IEEE Transactions on Knowledge and Data Engineering, 18(1), 63\u201377.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"5132_CR15","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1145\/1401890.1401953","volume-title":"KDD \u201908: proceeding of the 14th ACM SIGKDD international conference on knowledge discovery and data mining","author":"A. C. Lozano","year":"2008","unstructured":"Lozano, A. C., & Abe, N. (2008). Multi-class cost-sensitive boosting with p-norm loss functions. In KDD \u201908: proceeding of the 14th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 506\u2013514). New York: ACM."},{"key":"5132_CR16","series-title":"Lecture notes in computer science","volume-title":"A cost-sensitive paradigm for multiclass to binary decomposition schemes","author":"C. Marrocco","year":"2004","unstructured":"Marrocco, C., & Tortorella, F. (2004). A cost-sensitive paradigm for multiclass to binary decomposition schemes. Lecture notes in computer science (Vol.\u00a03138, pp.\u00a0753\u2013761). Berlin: Springer."},{"issue":"4","key":"5132_CR17","doi-asserted-by":"crossref","first-page":"1404","DOI":"10.1109\/18.243457","volume":"39","author":"J. W. Miller","year":"1993","unstructured":"Miller, J. W., Goodman, R., & Smyth, P. (1993). On loss functions which minimize to conditional expected values and posterior probabilities. IEEE Transactions on Information Theory, 39(4), 1404\u20131408.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5132_CR18","unstructured":"O\u2019Brien, D. B., & Gray, R. M. (2005). Improving classification performance by exploring the role of cost matrices in partitioning the estimated class probability space. In Proceedings of the ICML workshop on ROC analysis (pp.\u00a079\u201386)."},{"key":"5132_CR19","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1145\/1390156.1390246","volume-title":"ICML \u201908: proceedings of the 25th international conference on machine learning","author":"D. B. O\u2019Brien","year":"2008","unstructured":"O\u2019Brien, D. B., Gupta, M. R., & Gray, R. M. (2008). Cost-sensitive multi-class classification from probability estimates. In ICML \u201908: proceedings of the 25th international conference on machine learning (pp. 712\u2013719). New York: ACM."},{"key":"5132_CR20","first-page":"61","volume-title":"Advances in large margin classifiers","author":"J. C. Platt","year":"1999","unstructured":"Platt, J. C. (1999). Probabilistic outputs for support vector machines and comparisons to regularized likelihood methods. In Advances in large margin classifiers (pp. 61\u201374). Cambridge: MIT Press."},{"issue":"3","key":"5132_CR21","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1023\/A:1007601015854","volume":"42","author":"F. Provost","year":"2001","unstructured":"Provost, F., & Fawcett, T. (2001). Robust classification systems for imprecise environments. Machine Learning, 42(3), 203\u2013231.","journal-title":"Machine Learning"},{"key":"5132_CR22","doi-asserted-by":"crossref","unstructured":"Savage, L. J. (1971). Elicitation of personal probabilities and expectations. Journal of the American Statistical Association (pp. 783\u2013801).","DOI":"10.1080\/01621459.1971.10482346"},{"key":"5132_CR23","unstructured":"Stuetzle, W., Buja, A., & Shen, Y. (2005). Loss functions for binary class probability estimation and classification: Structure and applications (Technical report). Department of Statistics, University of Pennsylvania."},{"key":"5132_CR24","first-page":"204","volume-title":"Proceedings of the 7th ACM SIGKDD international conference on knowledge discovery and data mining","author":"B. Zadrozny","year":"2001","unstructured":"Zadrozny, B., & Elkan, C. (2001a). Learning and making decisions when costs and probabilities are both unknown. In Proceedings of the 7th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 204\u2013213). New York: ACM."},{"key":"5132_CR25","first-page":"609","volume-title":"ICML \u201901: proceedings of the eighteenth international conference on machine learning","author":"B. Zadrozny","year":"2001","unstructured":"Zadrozny, B., & Elkan, C. (2001b). Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers. In ICML \u201901: proceedings of the eighteenth international conference on machine learning (pp. 609\u2013616). San Francisco: Morgan Kaufmann."},{"key":"5132_CR26","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1145\/775047.775151","volume-title":"KDD \u201902: proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining","author":"B. Zadrozny","year":"2002","unstructured":"Zadrozny, B., & Elkan, C. (2002). Transforming classifier scores into accurate multiclass probability estimates. In KDD \u201902: proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining (pp. 694\u2013699). New York: ACM."},{"key":"5132_CR27","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1109\/ICDM.2003.1250950","volume-title":"ICDM \u201903: proc. of the 3rd IEEE int. conf. on data mining","author":"B. Zadrozny","year":"2003","unstructured":"Zadrozny, B., Langford, J., & Abe, N. (2003). Cost-sensitive learning by cost-proportionate example weighting. In ICDM \u201903: proc. of the 3rd IEEE int. conf. on data mining (p. 435). Washington: IEEE Comput. Soc."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-009-5132-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-009-5132-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-009-5132-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:40:27Z","timestamp":1559353227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-009-5132-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,23]]},"references-count":27,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["5132"],"URL":"https:\/\/doi.org\/10.1007\/s10994-009-5132-8","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7,23]]}}}