{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T17:48:02Z","timestamp":1789926482708,"version":"4.0.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319265315","type":"print"},{"value":"9783319265322","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26532-2_18","type":"book-chapter","created":{"date-parts":[[2016,3,23]],"date-time":"2016-03-23T17:06:19Z","timestamp":1458752779000},"page":"158-167","source":"Crossref","is-referenced-by-count":8,"title":["On Measuring the Complexity of Classification Problems"],"prefix":"10.1007","author":[{"given":"Ana Carolina","family":"Lorena","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcilio C. P.","family":"de Souto","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"18_CR1","unstructured":"Antolnez, N.M.: Data complexity in supervised learning: a far-reaching implication. Ph.D. thesis, La Salle, Universitat Ramon Llull (2011)"},{"key":"18_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-172-3","volume-title":"Data Complexity in Pattern Recognition","author":"M Basu","year":"2006","unstructured":"Basu, M., Ho, T.K.: Data Complexity in Pattern Recognition. Springer, London (2006)"},{"key":"18_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801389","volume-title":"An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods","author":"N Cristianini","year":"2000","unstructured":"Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods. Cambridge University Press, Cambridge (2000)"},{"key":"18_CR4","unstructured":"Cummins, L.: Combining and choosing case base maintenance algorithms. Ph.D. thesis, National University of Ireland, Cork (2013)"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1016\/S0167-8655(02)00303-3","volume":"24","author":"M Dong","year":"2003","unstructured":"Dong, M., Kothari, R.: Feature subset selection using a new definition of classificability. PRL 24, 1215\u20131225 (2003)","journal-title":"PRL"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.ins.2013.10.007","volume":"260","author":"MJ Flores","year":"2014","unstructured":"Flores, M.J., G\u00e1mez, J.A., Mart\u00ednez, A.M.: Domains of competence of the semi-naive bayesian network classifiers. Inf. Sci. 260, 120\u2013148 (2014)","journal-title":"Inf. Sci."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Garcia, L.P.F., de Carvalho, A.C.P.L.F., Lorena, A.C.: Effect of label noise in the complexity of classification problems. Neurocomputing (accepted) (2015, in press)","DOI":"10.1016\/j.neucom.2014.10.085"},{"issue":"3","key":"18_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1109\/34.990132","volume":"24","author":"TK Ho","year":"2002","unstructured":"Ho, T.K., Basu, M.: Complexity measures of supervised classification problems. IEEE Trans. Pattern Anal. Mach. Intell. 24(3), 289\u2013300 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Hoekstra, A., Duin, R.P.: On the nonlinearity of pattern classifiers. In: Proceedings of the 13th International Conference on Pattern Recognition, vol. 4, pp. 271\u2013275. IEEE (1996)","DOI":"10.1109\/ICPR.1996.547429"},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1109\/TSMCB.2009.2024166","volume":"40","author":"Q Hu","year":"2010","unstructured":"Hu, Q., Pedrycz, W., Yu, D., Lang, J.: Selecting discrete and continuous features based on neighborhood decision error minimization. IEEE Trans. Syst. Man Cybern. Part B Cybern. 40(1), 137\u2013150 (2010)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B Cybern."},{"key":"18_CR11","unstructured":"Li, L., Abu-Mostafa, Y.S.: Data complexity in machine learning. Technical Report CaltechCSTR:2006.004, Caltech Computer Science (2006)"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.neucom.2011.03.054","volume":"75","author":"AC Lorena","year":"2012","unstructured":"Lorena, A.C., Costa, I.G., Spolar, N., Souto, M.C.P.: Analysis of complexity indices for classification problems: cancer gene expression data. Neurocomputing 75, 33\u201342 (2012)","journal-title":"Neurocomputing"},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.ins.2011.09.022","volume":"185","author":"J Luengo","year":"2012","unstructured":"Luengo, J., Herrera, F.: Shared domains of competence of approximate learning models using measures of separability of classes. Inf. Sci. 185(1), 43\u201365 (2012)","journal-title":"Inf. Sci."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Mansilla, E.B., Ho, T.K.: On classifier domains of competence. In: Proceedings of the 17th ICPR, pp. 136\u2013139 (2004)","DOI":"10.1109\/ICPR.2004.1334026"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/11492542_4","volume-title":"Pattern Recognition and Image Analysis","author":"RA Mollineda","year":"2005","unstructured":"Mollineda, R.A., S\u00e1nchez, J.S., Sotoca, J.M.: Data characterization for effective prototype selection. In: Marques, J.S., P\u00e9rez de la Blanca, N., Pina, P. (eds.) IbPRIA 2005. LNCS, vol. 3523, pp. 27\u201334. Springer, Heidelberg (2005)"},{"key":"18_CR16","unstructured":"Orriols-Puig, A., Maci, N., Ho, T.K.: Documentation for the data complexity library in c++. Technical report, La Salle - Universitat Ramon Llull (2010)"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"1534","DOI":"10.1109\/TPAMI.2003.1251146","volume":"25","author":"S Singh","year":"2003","unstructured":"Singh, S.: Multiresolution estimates of classification complexity. IEEE Trans. PAMI 25, 1534\u20131539 (2003)","journal-title":"IEEE Trans. PAMI"},{"issue":"2","key":"18_CR18","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10994-013-5422-z","volume":"95","author":"MR Smith","year":"2014","unstructured":"Smith, M.R., Martinez, T., Giraud-Carrier, C.: An instance level analysis of data complexity. Mach. Learn. 95(2), 225\u2013256 (2014)","journal-title":"Mach. Learn."},{"key":"18_CR19","unstructured":"Souto, M.C.P., Lorena, A.C., Spolar, N., Costa, I.G.: Complexity measures of supervised classification tasks: a case study for cancer gene expression data. In: Proceedings of IJCNN, pp. 1352\u20131358 (2010)"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26532-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T12:42:31Z","timestamp":1559306551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26532-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319265315","9783319265322"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26532-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}