{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T19:46:21Z","timestamp":1760384781506},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440369"},{"type":"electronic","value":"9783540367550"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36755-1_23","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T21:03:29Z","timestamp":1194987809000},"page":"270-281","source":"Crossref","is-referenced-by-count":27,"title":["Class Probability Estimation and Cost-Sensitive Classification Decisions"],"prefix":"10.1007","author":[{"given":"Dragos D.","family":"Margineantu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,20]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"1545","DOI":"10.1162\/neco.1997.9.7.1545","volume":"9","author":"Y. Amit","year":"1997","unstructured":"Y. Amit and D. Geman. Shape quantization and recognition with randomized trees. Neural Computation, 9:1545\u20131588, 1997.","journal-title":"Neural Computation"},{"key":"23_CR2","volume-title":"The UCI KDD archive","author":"S. D. Bay","year":"1999","unstructured":"S. D. Bay. The UCI KDD archive. University of California, Irvine, Dept. of Information and Computer Sciences, 1999. [\n                    http:\/\/kdd.ics.uci.edu\/\n                    \n                  ]."},{"key":"23_CR3","volume-title":"UCI repository of machine learning databases","author":"C. L. Blake","year":"1998","unstructured":"C. L. Blake and C. J. Merz. UCI repository of machine learning databases. University of California, Irvine, Dept. of Information and Computer Sciences, 1998. [\n                    http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html\n                    \n                  ]."},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"J. P. Bradford, C. Kunz, R. Kohavi, C. Brunk, and C. E. Brodley. Pruning decision trees with misclassification costs. In C. Nedellec and C. Rouveirol, editors, Lecture Notes in Artificial Intelligence. Machine Learning: ECML-98, Tenth European Conference on Machine Learning, Proceedings, volume 1398, pages 131\u2013136, Berlin, New York, 1998. Springer Verlag.","DOI":"10.1007\/BFb0026682"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1016\/S0031-3203(96)00142-2","volume":"30","author":"A. P. Bradley","year":"1997","unstructured":"A. P. Bradley. The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern Recognition, 30:1145\u20131159, 1997.","journal-title":"Pattern Recognition"},{"key":"23_CR6","series-title":"Technical report","volume-title":"Out-of-bag estimation","author":"L. Breiman","year":"1998","unstructured":"L. Breiman. Out-of-bag estimation. Technical report, Department of Statistics, University of California, Berkeley, 1998."},{"key":"23_CR7","series-title":"Technical report","volume-title":"Random forests","author":"L. Breiman","year":"2001","unstructured":"L. Breiman. Random forests. Technical report, Department of Statistics, University of California, Berkeley, 2001."},{"key":"23_CR8","unstructured":"L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadsworth International Group, 1984."},{"key":"23_CR9","unstructured":"B. Cestnik. Estimating probabilities: A crucial task in machine learning. In L. C. Aiello, editor, Proceedings of the Ninth European Conference on Artificial Intelligence, pages 147\u2013149, London, 1990. Pitman Publishing."},{"issue":"2","key":"23_CR10","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1007607513941","volume":"40","author":"T. G. Dietterich","year":"2000","unstructured":"T. G. Dietterich. An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting and randomization. Machine Learning, 40(2):139\u2013158, 2000.","journal-title":"Machine Learning"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"P. Domingos. Metacost: A general method for making classifiers cost-sensitive. In Proceedings of the Fifth International Conference on Knowledge Discovery and Data Mining, pages 155\u2013164, New York, 1999. ACM Press.","DOI":"10.1145\/312129.312220"},{"key":"23_CR12","unstructured":"C. Drummond and R. C. Holte. Exploiting the cost (in)sensitivity of decision tree splitting criteria. In Machine Learning: Proceedings of the Seventeenth International Conference, pages 239\u2013246, San Francisco, CA, 2000. Morgan Kaufmann."},{"key":"23_CR13","unstructured":"R. O. Duda, P. E. Hart, and D. G. Stork. Pattern Classification. John Wiley and Sons, Inc.\u2014Interscience, second edition, 2000."},{"key":"23_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-4541-9","volume-title":"An Introduction to the Bootstrap","author":"B. Efron","year":"1993","unstructured":"B. Efron and R. J. Tibshirani. An Introduction to the Bootstrap. Chapman and Hall, New York, 1993."},{"key":"23_CR15","unstructured":"C. Elkan. The foundations of cost-sensitive learning. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Morgan Kaufmann Publishers, Inc., 2001."},{"key":"23_CR16","unstructured":"W. Fan, S. J. Stolfo, J. Zhang, and P. K. Chan. AdaCost: Misclassification costsensitive boosting. In Machine Learning: Proceedings of the Sixteenth International Conference, pages 97\u2013105, San Francisco, 1999. Morgan Kaufmann."},{"key":"23_CR17","unstructured":"I. J. Good. The Estimation of Probabilities: An Essay on Modern Bayesian Methods. M. I. T. Press, Cambridge, Mass., 1965."},{"key":"23_CR18","unstructured":"N. Japkowicz. The class imbalance problem: Significance and strategies. In Proceedings of the 2000 International Conference on Artificial Intelligence (IC-AI\u20192000), 2000."},{"key":"23_CR19","unstructured":"M. Kukar and I. Kononenko. Cost-sensitive learning with neural networks. In Proceedings of the Thirteenth European Conference on Artificial Intelligence, Chichester, NY, 1998. Wiley."},{"key":"23_CR20","unstructured":"T. Leonard and J. S. J. Hsu. Bayesian Methods, An Analysis for Statisticians and Interdisciplinary Researchers. Cambridge University Press, 1999."},{"key":"23_CR21","unstructured":"D. D. Margineantu. Building ensembles of classifiers for loss minimization. In M. Pourahmadi, editor, Models, Predictions and Computing: Proceedings of the 31st Symposium on the Interface, volume 31, pages 190\u2013194. The Interface Foundation of North America, 1999."},{"key":"23_CR22","series-title":"Technical report","volume-title":"Methods for cost-sensitive learning","author":"D. D. Margineantu","year":"2001","unstructured":"D. D. Margineantu. Methods for cost-sensitive learning. Technical report, Department of Computer Science, Oregon State University, Corvallis, OR, 2001."},{"key":"23_CR23","unstructured":"D. D. Margineantu and T. G. Dietterich. Bootstrap methods for the cost-sensitive evaluation of classifiers. In Machine Learning: Proceedings of the Seventeenth International Conference, pages 583\u2013590, San Francisco, CA, 2000. Morgan Kaufmann."},{"key":"23_CR24","unstructured":"E. P. D. Pednault, B. K. Rosen, and C. Apte. The importance of estimation errors in cost-sensitive learning. In Cost-Sensitive Learning Workshop Notes, 2000."},{"key":"23_CR25","unstructured":"F. Provost and P. Domingos. Well-trained PETs: Improving probability estimation trees. Technical Report IS-00-04, Stern School of Business, New York University, 2000."},{"key":"23_CR26","unstructured":"F. Provost, T. Fawcett, and R. Kohavi. The case against accuracy estimation for comparing classifiers. In Proceedings of the Fifteenth International Conference on Machine Learning, pages 445\u2013453. Morgan Kaufmann, San Francisco, 1998."},{"key":"23_CR27","volume-title":"C4.5: Programs for Machine Learning","author":"J. R. Quinlan","year":"1993","unstructured":"J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco, 1993."},{"key":"23_CR28","unstructured":"M. Saar-Tsechansky and F. Provost. Active learning for class probability estimation and ranking. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, pages 911\u2013917. AAAI Press\/MIT Press, 2001."},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"P. Smyth, A. Gray, and U. Fayyad. Retrofitting decision tree classifiers using kernel density estimation. In Machine Learning: Proceedings of the Twelvth International Conference, pages 506\u2013514, 1995.","DOI":"10.1016\/B978-1-55860-377-6.50069-4"},{"key":"23_CR30","unstructured":"B. Zadrozny and C. Elkan. Obtaining calibrated probability estimates from decision trees and naive bayesian classifiers. In Proceedings of the Eighteenth International Conference on Machine Learning, pages 609\u2013616, San Francisco, CA, 2001. Morgan Kaufmann."}],"container-title":["Lecture Notes in Computer Science","Machine Learning: ECML 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36755-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T06:36:51Z","timestamp":1551076611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36755-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440369","9783540367550"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-36755-1_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}