{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T17:34:22Z","timestamp":1770485662800,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642412776","type":"print"},{"value":"9783642412783","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41278-3_4","type":"book-chapter","created":{"date-parts":[[2013,10,16]],"date-time":"2013-10-16T13:41:50Z","timestamp":1381930910000},"page":"24-31","source":"Crossref","is-referenced-by-count":32,"title":["Racing for Unbalanced Methods Selection"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Dal Pozzolo","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Caelen","sequence":"additional","affiliation":[]},{"given":"Serge","family":"Waterschoot","sequence":"additional","affiliation":[]},{"given":"Gianluca","family":"Bontempi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"D.N.A.\u00a0Asuncion. UCI machine learning repository (2007)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/10720076_29","volume-title":"MICAI 2000: Advances in Artificial Intelligence","author":"G. Batista","year":"2000","unstructured":"Batista, G., Carvalho, A., Monard, M.: Applying one-sided selection to unbalanced datasets. In: Cair\u00f3, O., Cant\u00fa, F.J. (eds.) MICAI 2000. LNCS, vol.\u00a01793, pp. 315\u2013325. Springer, Heidelberg (2000)"},{"key":"4_CR3","unstructured":"Birattari, M.: Race: Racing methods for the selection of the best, R package version 0.1.59 (2012)"},{"key":"4_CR4","unstructured":"Birattari, M., St\u00fctzle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 11\u201318 (2002)"},{"key":"4_CR5","first-page":"1106","volume":"arXiv","author":"N. Chawla","year":"2011","unstructured":"Chawla, N., Bowyer, K., Hall, L., Kegelmeyer, W.: Smote: synthetic minority over-sampling technique. Arxiv preprint arXiv:1106.1813 (2011)","journal-title":"Arxiv preprint"},{"issue":"4","key":"4_CR6","first-page":"261","volume":"3","author":"P. Clark","year":"1989","unstructured":"Clark, P., Niblett, T.: The cn2 induction algorithm. Machine Learning\u00a03(4), 261\u2013283 (1989)","journal-title":"Machine Learning"},{"key":"4_CR7","unstructured":"Drummond, C., Holte, R., et al.: C4. 5, class imbalance, and cost sensitivity: why under-sampling beats over-sampling. In: Workshop on Learning from Imbalanced Datasets II. Citeseer (2003)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Hart, P.E.: The condensed nearest neighbor rule. IEEE Transactions on Information Theory (1968)","DOI":"10.1109\/TIT.1968.1054155"},{"key":"4_CR9","unstructured":"Holte, R.C., Acker, L.E., Porter, B.W., et al.: Concept learning and the problem of small disjuncts. In: Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, vol.\u00a01. Citeseer (1989)"},{"issue":"5","key":"4_CR10","doi-asserted-by":"crossref","first-page":"429","DOI":"10.3233\/IDA-2002-6504","volume":"6","author":"N. Japkowicz","year":"2002","unstructured":"Japkowicz, N., Stephen, S.: The class imbalance problem: A systematic study. Intelligent Data Analysis\u00a06(5), 429\u2013449 (2002)","journal-title":"Intelligent Data Analysis"},{"key":"4_CR11","unstructured":"Kubat, M., Matwin, S., et al.: Addressing the curse of imbalanced training sets: one-sided selection. In: Machine Learning-International Workshop Then Conference, pp. 179\u2013186. Morgan Kaufmann Publishers, Inc. (1997)"},{"key":"4_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-48229-6_9","volume-title":"Artificial Intelligence in Medicine","author":"J. Laurikkala","year":"2001","unstructured":"Laurikkala, J.: Improving identification of difficult small classes by balancing class distribution. In: Quaglini, S., Barahona, P., Andreassen, S. (eds.) AIME 2001. LNCS (LNAI), vol.\u00a02101, pp. 63\u201366. Springer, Heidelberg (2001)"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1109\/TSMCB.2008.2007853","volume":"39","author":"X. Liu","year":"2009","unstructured":"Liu, X., Wu, J., Zhou, Z.: Exploratory undersampling for class-imbalance learning. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics\u00a039(2), 539\u2013550 (2009)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1109\/TNNLS.2012.2228231","volume":"24","author":"K.T.M. Lin","year":"2013","unstructured":"Lin, K.T.M., Yao, X.: A dynamic sampling approach to training neural networks for multi-class imbalance classification. IEEE Transactions on Neural Networks and Learning Systems\u00a024, 647\u2013660 (2013)","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"4_CR15","unstructured":"Maron, O., Moore, A.: Hoeffding races: Accelerating model selection search for classification and function approximation, p. 263. Robotics Institute (1993)"},{"key":"4_CR16","unstructured":"Olshen, L., Stone, C.: Classification and regression trees. Wadsworth International Group (1984)"},{"key":"4_CR17","unstructured":"Quinlan, J.R.: C4. 5: programs for machine learning, vol.\u00a01. Morgan Kaufmann (1993)"},{"key":"4_CR18","unstructured":"R Development Core Team. R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2011) ISBN 3-900051-07-0"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/TSMC.1976.4309452","volume":"6","author":"I. Tomek","year":"1976","unstructured":"Tomek, I.: Two modifications of cnn. IEEE Trans. Syst. Man Cybern.\u00a06, 769\u2013772 (1976)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Wilson, D.: Asymptotic properties of nearest neighbor rules using edited data. IEEE Transactions on Systems, Man and Cybernetics\u00a0(3), 408\u2013421 (1972)","DOI":"10.1109\/TSMC.1972.4309137"},{"issue":"3","key":"4_CR21","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1007626913721","volume":"38","author":"D. Wilson","year":"2000","unstructured":"Wilson, D., Martinez, T.: Reduction techniques for instance-based learning algorithms. Machine Learning\u00a038(3), 257\u2013286 (2000)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41278-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T17:10:20Z","timestamp":1558631420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41278-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642412776","9783642412783"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41278-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}