{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:38:07Z","timestamp":1758271087630,"version":"3.37.3"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2982133","type":"journal-article","created":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T21:58:42Z","timestamp":1584655122000},"page":"56312-56320","source":"Crossref","is-referenced-by-count":9,"title":["An Algorithm for Computing Minimum-Length Irreducible Testors"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4189-6208","authenticated-orcid":false,"given":"Ivan","family":"Piza-Davila","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillermo","family":"Sanchez-Diaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel S.","family":"Lazo-Cortes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Villalon-Turrubiates","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","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\ufffdticas"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2013.11.006"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.07.037"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.12.027"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(78)90005-5"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-335-6.50036-2"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1080\/18756891.2012.747657"},{"key":"ref36","first-page":"506","article-title":"CT EXT: An external escale algorithm for generated typical testors","volume":"4756","author":"sanchez-diaz","year":"2007","journal-title":"Proc 12th Iberoamerican Congr Pattern Recognit"},{"key":"ref35","first-page":"123","article-title":"Characterization of the typical testor concept in terms of a notable set of columns","volume":"1","author":"ruiz-shulcloper","year":"1980","journal-title":"Revista Ciencias Matem\ufffdticas"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.07.004"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2017.05.026"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001418600017"},{"key":"ref29","first-page":"643","article-title":"Using typical testors for feature selection in text categorization","volume":"4756","author":"pons-porrata","year":"2007","journal-title":"Proc Iberoamer Congr Pattern Recognit (CIARP)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.04.020"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112824"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/APCIP.2009.202"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1201\/9781584888796"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001413500225"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmp.2005.06.008"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-3282-y"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-014-0606-1"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0020-7101(95)01143-9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4314"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28651-6_62"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/978-981-13-2285-3_43","article-title":"Hybrid technique based on DBSCAN for selection of improved features for intrusion detection system","volume":"841","author":"saxena","year":"2019","journal-title":"Advances in Intelligent Systems and Computing"},{"key":"ref12","first-page":"3","article-title":"About mathematical principles and phenomena classification","volume":"7","author":"dmitriev","year":"1966","journal-title":"Diskretnyi Analiz"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.03.052"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1186\/s13637-014-0013-2"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s11554-016-0650-7"},{"key":"ref16","first-page":"1","article-title":"Formulas behind deep learning success","author":"goceri","year":"2018","journal-title":"Proc Int Conf Appl Anal Math Model"},{"key":"ref17","first-page":"1","article-title":"On the importance of batch size for deep learning","author":"goceri","year":"2018","journal-title":"Proc Int Conf Math"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1198\/016214501753168398"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.09.045"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-3249-z"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12568-8_51"},{"key":"ref6","article-title":"Towards a robust classifier: An MDL-based method for generating adversarial examples","author":"asadi","year":"2019","journal-title":"arXiv 1912 05945"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.08.051"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34869-4_35"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2004.03.007"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1305-0"},{"key":"ref9","first-page":"449","article-title":"Multiple reducts computation in rough sets with applications to ensemble classification","volume":"605","author":"bar","year":"2019","journal-title":"Proc ICET"},{"key":"ref46","first-page":"208","article-title":"On computational complexity of non-reducible descriptors","author":"valev","year":"2003","journal-title":"Proc IEEE Int Conf Inf Reuse Integration"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s12859-018-2023-7","article-title":"Feature selection for high-dimensional temporal data","volume":"19","author":"tsagris","year":"2018","journal-title":"BMC Bioinf"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.12.031"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(91)90071-C"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2925819"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-017-2988-6"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1348-2"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.protcy.2012.05.007"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09042321.pdf?arnumber=9042321","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:57:15Z","timestamp":1642003035000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9042321\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2982133","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}