{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T15:19:09Z","timestamp":1786202349562,"version":"3.56.0"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100002207","name":"Directorate-General for Communications Networks, Content and Technology","doi-asserted-by":"publisher","award":["732667"],"award-info":[{"award-number":["732667"]}],"id":[{"id":"10.13039\/501100002207","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Spanish Ministry of Science, Innovation and Universities","award":["TIN2017-88749-R (DisCoEdge)"],"award-info":[{"award-number":["TIN2017-88749-R (DisCoEdge)"]}]},{"DOI":"10.13039\/100012818","name":"Comunidad de Madrid","doi-asserted-by":"publisher","award":["P2018\/TCS-4499 (EdgeData-CM)"],"award-info":[{"award-number":["P2018\/TCS-4499 (EdgeData-CM)"]}],"id":[{"id":"10.13039\/100012818","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012818","name":"Comunidad de Madrid","doi-asserted-by":"publisher","award":["S2018\/TCS-4496 (TAPIR-CM)"],"award-info":[{"award-number":["S2018\/TCS-4496 (TAPIR-CM)"]}],"id":[{"id":"10.13039\/100012818","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61520106005"],"award-info":[{"award-number":["61520106005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003339","name":"Consejo Superior de Investigaciones Cient\u00edficas","doi-asserted-by":"publisher","award":["RYC-2014-16285"],"award-info":[{"award-number":["RYC-2014-16285"]}],"id":[{"id":"10.13039\/501100003339","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2930235","type":"journal-article","created":{"date-parts":[[2019,7,22]],"date-time":"2019-07-22T19:20:52Z","timestamp":1563823252000},"page":"99978-99987","source":"Crossref","is-referenced-by-count":61,"title":["A Novel Hyperparameter-Free Approach to Decision Tree Construction That Avoids Overfitting by Design"],"prefix":"10.1109","volume":"7","author":[{"given":"Rafael","family":"Garc\u00eda Leiva","sequence":"first","affiliation":[{"name":"IMDEA Networks Institute, Madrid, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antonio","family":"Fern\u00e1ndez Anta","sequence":"additional","affiliation":[{"name":"IMDEA Networks Institute, Madrid, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vincenzo","family":"Mancuso","sequence":"additional","affiliation":[{"name":"IMDEA Networks Institute, Madrid, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6401-1660","authenticated-orcid":false,"given":"Paolo","family":"Casari","sequence":"additional","affiliation":[{"name":"IMDEA Networks Institute, Madrid, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","first-page":"2825","article-title":"Scikit-learn: Machine learning in python","volume":"12","author":"pedregosa","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"367","DOI":"10.4310\/CIS.2005.v5.n4.a1","article-title":"Common pitfalls using the normalized compression distance: What to watch out for in a compressor","volume":"5","author":"cebri\u00e1n","year":"2005","journal-title":"Commun Inf Syst"},{"key":"ref31","article-title":"A block-sorting lossless data compression algorithm","author":"burrows","year":"1994"},{"key":"ref30","article-title":"Deflate compressed data format specification version 1.3","author":"deutsch","year":"1951"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2009.05.016"},{"key":"ref35","author":"dheeru","year":"2017","journal-title":"UCI Machine Learning Repository"},{"key":"ref34","author":"starnes","year":"2010","journal-title":"The Practice of Statistics"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.2307\/2986296"},{"key":"ref11","first-page":"48","volume":"38","author":"quinlan","year":"1993","journal-title":"C4 5 Programs for Machine Learning"},{"key":"ref12","first-page":"815","article-title":"Split selection methods for classification trees","volume":"7","author":"loh","year":"1997","journal-title":"Statistica Sinica"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176347963"},{"key":"ref14","first-page":"24","article-title":"Public: A decision tree classifier that integrates building and pruning","volume":"98","author":"rastogi","year":"1998","journal-title":"Proc VLDB"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2017.00140"},{"key":"ref16","first-page":"1219","article-title":"Alternating optimization of decision trees, with application to learning sparse oblique trees","author":"carreira-perpin\u00e1n","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007608224229"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.04.003"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(64)90223-2"},{"key":"ref28","volume":"12","author":"miettinen","year":"2012","journal-title":"Nonlinear Multiobjective Optimization"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF00993345"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1"},{"key":"ref3","article-title":"Beyond sparsity: Tree regularization of deep models for interpretability","author":"wu","year":"2017","journal-title":"arXiv 1711 06178"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1111\/insr.12016"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511812651"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116251"},{"key":"ref7","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref2","volume":"1","author":"friedman","year":"2001","journal-title":"The Elements of Statistical Learning"},{"key":"ref9","author":"breiman","year":"1984","journal-title":"Classification and Regression Trees"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1142\/SMPAI"},{"key":"ref20","first-page":"1","article-title":"Three approaches to the quantitative definition of information","volume":"1","author":"kolmogorov","year":"1965","journal-title":"Problems Inf Transmiss"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4643.001.0001"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/321526.321530"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90010-2"},{"key":"ref23","author":"wallace","year":"2005","journal-title":"Statistical and Inductive Inference by Minimum Message Length"},{"key":"ref26","first-page":"216","article-title":"MDL-based decision tree pruning","volume":"21","author":"mehta","year":"1995","journal-title":"Proc KDD"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022646101185"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08767915.pdf?arnumber=8767915","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T06:00:08Z","timestamp":1769493608000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8767915\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2930235","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}