<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462023000200357</article-id>
<article-id pub-id-type="doi">10.13053/cys-27-2-4243</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Adding Learning Capabilities to the LEX Algorithm for Computing Minimal Transversals]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Guevara]]></surname>
<given-names><![CDATA[Ingrid]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Godoy-Calderon]]></surname>
<given-names><![CDATA[Salvador]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Alba]]></surname>
<given-names><![CDATA[Eduardo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Escuela Politécnica Nacional  ]]></institution>
<addr-line><![CDATA[Quito ]]></addr-line>
<country>Ecuador</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Instituto Politécnico Nacional Centro de Investigación en Computación ]]></institution>
<addr-line><![CDATA[Mexico City ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad San Francisco de Quito Colegio de Ciencias e Ingenierías ]]></institution>
<addr-line><![CDATA[Quito ]]></addr-line>
<country>Ecuador</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2023</year>
</pub-date>
<volume>27</volume>
<numero>2</numero>
<fpage>357</fpage>
<lpage>370</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462023000200357&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462023000200357&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462023000200357&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: Despite being little known and poorly documented, LEX is part of the family of typical testors-finding algorithms that generally has better performance than other much more divulged similar algorithms. The recently published relationship between typical testors and minimal hitting sets, potentially extends the usefulness and applicability of this algorithm to the hypergraphs and data mining fields. Unfortunately, the high time-complexity of both typical testors and minimal hitting sets algorithms still remains a major obstacle. Therefore, alternatives that can help overcome difficult problems are constantly being researched. In this paper we propose the inclusion of a symbolic learning behavior into the implementation of the LEX algorithm. The incorporated symbolic learning is a general strategy for optimizing the search process, and thus improves the efficiency of minimal transversals and typical testors algorithms. In addition, the performance of the resulting algorithm is assessed by using carefully designed benchmark test matrices.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[LEX algorithm]]></kwd>
<kwd lng="en"><![CDATA[learning strategy]]></kwd>
<kwd lng="en"><![CDATA[minimal transversals]]></kwd>
<kwd lng="en"><![CDATA[hypergraph]]></kwd>
<kwd lng="en"><![CDATA[irreducible testor]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Alba-Cabrera]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Godoy-Calderon]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Ibarra-Fiallo]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Generating synthetic test matrices as a benchmark for the computational behavior of typical testor-finding algorithms]]></article-title>
<source><![CDATA[Pattern Recognition Letters]]></source>
<year>2016</year>
<volume>80</volume>
<page-range>46-51</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Alba-Cabrera]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Godoy-Calderon]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Lazo-Cortés]]></surname>
<given-names><![CDATA[M. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Martínez-Trinidad]]></surname>
<given-names><![CDATA[J. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Carrasco-Ochoa]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the relation between the concepts of irreducible testor and minimal transversal]]></article-title>
<source><![CDATA[IEEE Access]]></source>
<year>2019</year>
<volume>7</volume>
<page-range>82809-16</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Alba-Cabrera]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Ibarra-Fiallo]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Godoy-Calderon]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[A theoretical and practical framework for assessing the computational behavior of typical testor-finding algorithms]]></source>
<year>2013</year>
<conf-name><![CDATA[ Iberoamerican Congress on Pattern Recognition]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Alba-Cabrera]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Ibarra-Fiallo]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Godoy-Calderon]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Cervantes-Alonso]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[YYC: A fast performance incremental algorithm for finding typical testors]]></source>
<year>2014</year>
<conf-name><![CDATA[ Iberoamerican Congress on Pattern Recognition]]></conf-name>
<conf-loc> </conf-loc>
<page-range>416-23</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Berge]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Hypergraphs: Combinatorics of finite sets]]></source>
<year>1984</year>
<volume>45</volume>
<publisher-loc><![CDATA[North-Holland ]]></publisher-loc>
<publisher-name><![CDATA[Mathematical Library]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Carrasco-Ochoa]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Martínez-Trinidad]]></surname>
<given-names><![CDATA[J. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[Z. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Yin]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Everson]]></surname>
<given-names><![CDATA[R. M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Feature selection for natural disaster texts classification using testors]]></source>
<year>2004</year>
<volume>3177</volume>
<conf-name><![CDATA[ Intelligent Data Engineering and Automated Learning&#8211;IDEAL 2004: 5th International Conference]]></conf-name>
<conf-loc> </conf-loc>
<page-range>424-9</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dua]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Graff]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[UCI machine learning repository]]></source>
<year>2017</year>
<publisher-loc><![CDATA[irvine, ca ]]></publisher-loc>
<publisher-name><![CDATA[University of California, School of Information and Computer Science]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Eiter]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Gottlob]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Hypergraph transversal computation and related problems in logic and ai]]></source>
<year>2002</year>
<conf-name><![CDATA[ European Workshop on Logics in Artificial Intelligence]]></conf-name>
<conf-loc> </conf-loc>
<page-range>549-64</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Elbassioni]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Hagen]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Rauf]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A lower bound for the HBC transversal hypergraph generation]]></article-title>
<source><![CDATA[Fundamenta Informaticae]]></source>
<year>2014</year>
<volume>130</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>409-14</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gallegos]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Torres]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Álvarez]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Soto]]></surname>
<given-names><![CDATA[A. T.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Feature subset selection and typical testors applied to breast cancer cells]]></article-title>
<source><![CDATA[Research in Computing Science]]></source>
<year>2016</year>
<volume>121</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>151-63</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[González-Guevara]]></surname>
<given-names><![CDATA[V. I.]]></given-names>
</name>
<name>
<surname><![CDATA[Godoy-Calderon]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Alba-Cabrera]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Calvo]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Symbolic learning for improving the performance of transversal-computation algorithms]]></article-title>
<source><![CDATA[IEEE Access]]></source>
<year>2019</year>
<volume>7</volume>
<page-range>19752-61</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gunopulos]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Mannila]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Khardon]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Toivonen]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Data mining, hypergraph transversals, and machine learning]]></source>
<year>1997</year>
<conf-name><![CDATA[ sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of database systems]]></conf-name>
<conf-loc> </conf-loc>
<page-range>209-16</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hagen]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Lower bounds for three algorithms for transversal hypergraph generation]]></article-title>
<source><![CDATA[Discrete Applied Mathematics]]></source>
<year>2009</year>
<volume>157</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>1460-9</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kavvadias]]></surname>
<given-names><![CDATA[D. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Stavropoulos]]></surname>
<given-names><![CDATA[E. C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An efficient algorithm for the transversal hypergraph generation]]></article-title>
<source><![CDATA[Journal of Graph Algorithms and Applications]]></source>
<year>2005</year>
<volume>9</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>239-64</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lias-Rodríguez]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Pons-Porrata]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Br: A new method for computing all typical testors]]></source>
<year>2009</year>
<conf-name><![CDATA[ Iberoamerican Congress on Pattern Recognition]]></conf-name>
<conf-loc> </conf-loc>
<page-range>433-40</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lias-Rodríguez]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Sánchez-Díaz]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An algorithm for computing typical testors based on elimination of gaps and reduction of columns]]></article-title>
<source><![CDATA[International Journal of Pattern Recognition and Artificial Intelligence]]></source>
<year>2013</year>
<volume>27</volume>
<numero>08</numero>
<issue>08</issue>
<page-range>1350022</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[López-Pérez]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Lazo-Cortés]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Estrada-García]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Medical electro-diagnostic using pattern recognition tools]]></source>
<year>1997</year>
<conf-name><![CDATA[ iberoamerican workshop on pattern recognition (TIARP 97)]]></conf-name>
<conf-loc> </conf-loc>
<page-range>237-44</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Muenala]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Ibarra-Fiallo]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Intriago-Pazmiño]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Study of the number recognition algorithms efficiency after a reduction of the characteristic space using typical testors]]></source>
<year>2019</year>
<volume>1</volume>
<conf-name><![CDATA[ New Knowledge in Information Systems and Technologies]]></conf-name>
<conf-loc> </conf-loc>
<page-range>875-85</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ochoa Somuano]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Valdés Marrero]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Moctezuma Cantorán]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Ayala Esquivel]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Dimension reduction in image databases using the logical combinatorial approach]]></source>
<year>2008</year>
<conf-name><![CDATA[ Innovations and Advanced Techniques in Systems, Computing Sciences and Software Engineering]]></conf-name>
<conf-loc> </conf-loc>
<page-range>260-5</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pino Gómez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Hernández Montero]]></surname>
<given-names><![CDATA[F. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Charles Sotelo]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Gómez Mancilla]]></surname>
<given-names><![CDATA[J. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Villuendas Rey]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[RoPM: An algorithm for computing typical testors based on recursive reductions of the basic matrix]]></article-title>
<source><![CDATA[]]></source>
<year>2021</year>
<volume>9</volume>
<page-range>128220-32</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Piza-Dávila]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Sánchez-Díaz]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Lazo-Cortés]]></surname>
<given-names><![CDATA[M. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Noyola-Medrano]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Enhancing the performance of YYC algorithm useful to generate irreducible testors]]></article-title>
<source><![CDATA[International Journal of Pattern Recognition and Artificial Intelligence]]></source>
<year>2018</year>
<volume>32</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1860001</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Santiesteban-Alganza]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Pons-Porrata]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[LEX: A new algorithm for calculating typical testors]]></article-title>
<source><![CDATA[Revista Ciencias Matematicas]]></source>
<year>2003</year>
<volume>21</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>85-95</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Torres]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Torres]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Ponce-de León]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Genetic algorithm and typical testors in feature subset selection problem]]></source>
<year>2006</year>
<conf-name><![CDATA[ 6th iberoamerican conference on systemics, cybernetics and informatics]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1-5</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Torres]]></surname>
<given-names><![CDATA[M. D.]]></given-names>
</name>
<name>
<surname><![CDATA[Torres]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Cuéllar]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[de la Luz Torres]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[de León]]></surname>
<given-names><![CDATA[E. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Pinales]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Evolutionary computation in the identification of risk factors. Case of Trali]]></article-title>
<source><![CDATA[Expert systems with applications]]></source>
<year>2014</year>
<volume>41</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>831-40</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vázquez]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Godoy-Calderon]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Using testor theory to reduce the dimensión of neural network models]]></article-title>
<source><![CDATA[Neural Networks and Associative Memories]]></source>
<year>2007</year>
<volume>28</volume>
<page-range>93-103</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
