{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T04:53:33Z","timestamp":1744174413250,"version":"3.37.3"},"reference-count":23,"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:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100007350","name":"Consejo Nacional de Ciencia y Tecnolog\u00eda","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007350","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003069","name":"Instituto Polit\u00e9cnico Nacional","doi-asserted-by":"crossref","award":["SIP 20180801","20182114","20195886","20196094"],"award-info":[{"award-number":["SIP 20180801","20182114","20195886","20196094"]}],"id":[{"id":"10.13039\/501100003069","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Est\u00edmulos al Desempe\u00f1o a la Investigaci\u00f3n"},{"name":"Chancelor Grant Universidad San Francisco de Quito","award":["2268 2015"],"award-info":[{"award-number":["2268 2015"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2895296","type":"journal-article","created":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T20:21:38Z","timestamp":1548447698000},"page":"19752-19761","source":"Crossref","is-referenced-by-count":1,"title":["Symbolic Learning for Improving the Performance of Transversal-Computation Algorithms"],"prefix":"10.1109","volume":"7","author":[{"given":"Victor Ivan","family":"Gonzalez-Guevara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvador","family":"Godoy-Calderon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Alba-Cabrera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2836-2102","authenticated-orcid":false,"given":"Hiram","family":"Calvo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"416","article-title":"YYC: A fast performance incremental algorithm for finding typical testors","author":"alba-cabrera","year":"2014","journal-title":"Proc Iberoamerican Congr Pattern Recognit"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0062"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1837210.1837221"},{"key":"ref13","volume":"4a","author":"knuth","year":"2011","journal-title":"The Art of Computer Programming Combinatorial Algorithms Part 1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_10"},{"key":"ref15","first-page":"85","article-title":"LEX: A new algorithm for calculating typical testors","volume":"21","author":"santiesteban-alganza","year":"2003","journal-title":"Revista Ciencias Matemáticas"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/18756891.2012.747657"},{"key":"ref17","first-page":"433","article-title":"BR: A new method for computing all typical testors","author":"lias-rodr\u00edguez","year":"2009","journal-title":"Proc Progr Pattern Recognit Image Anal Comput Vis Appl"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250958"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1.3.190"},{"journal-title":"Algorithmic and Computational Complexity Issues of MONET","year":"2008","author":"hagen","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1970.222917"},{"journal-title":"Machine Learning An Artificial Intelligence Approach","year":"2013","author":"michalski","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.10.004"},{"key":"ref8","volume":"45","author":"berge","year":"1984","journal-title":"Hypergraphs Combinatorics of Finite Sets"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25751-8_86"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00107"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.01.012"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-004-0178-1"},{"key":"ref20","first-page":"127","article-title":"Fast-BR vs. fast-CT_EXT: An empirical performance study","author":"rodr\u00edguez-diez","year":"2017","journal-title":"Proc 4th Mexican Conf Pattern Recog"},{"key":"ref22","first-page":"351","article-title":"A theoretical and practical framework for assessing the computational behavior of typical testor-finding algorithms","author":"alba-cabrera","year":"2013","journal-title":"Proc Iberoamerican Congr Pattern Recognit"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001418600017"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.04.020"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08626112.pdf?arnumber=8626112","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T06:45:30Z","timestamp":1643265930000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8626112\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2895296","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}