<?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>1409-2433</journal-id>
<journal-title><![CDATA[Revista de Matemática Teoría y Aplicaciones]]></journal-title>
<abbrev-journal-title><![CDATA[Rev. Mat]]></abbrev-journal-title>
<issn>1409-2433</issn>
<publisher>
<publisher-name><![CDATA[Centro de Investigaciones en Matemática Pura y Aplicada (CIMPA) y Escuela de Matemática, San José, Costa Rica.]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1409-24332011000100011</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Reductos mínimos con GRASP]]></article-title>
<article-title xml:lang="en"><![CDATA[Minimal reducts with GRASP]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Méndez-Gurrola]]></surname>
<given-names><![CDATA[Iris Iddaly]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Laureano-Cruces]]></surname>
<given-names><![CDATA[Ana Lilia]]></given-names>
</name>
<xref ref-type="aff" rid="A02"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ramírez-Rodríguez]]></surname>
<given-names><![CDATA[Javier]]></given-names>
</name>
<xref ref-type="aff" rid="A03"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,UAM-A Posgrado en Diseño, Línea: Nuevas Tecnologías ]]></institution>
<addr-line><![CDATA[ México, D. F]]></addr-line>
</aff>
<aff id="A02">
<institution><![CDATA[,Universidad Autónoma Metropolitana Departamento de Sistemas ]]></institution>
<addr-line><![CDATA[ México D. F]]></addr-line>
</aff>
<aff id="A03">
<institution><![CDATA[,Universidad Autónoma Metropolitana Departamento de Sistemas ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2011</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2011</year>
</pub-date>
<volume>18</volume>
<numero>1</numero>
<fpage>149</fpage>
<lpage>162</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_arttext&amp;pid=S1409-24332011000100011&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_abstract&amp;pid=S1409-24332011000100011&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_pdf&amp;pid=S1409-24332011000100011&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[La detección adecuada del nivel de demencia de un paciente es importante para brindar el tratamiento adecuado. El diagnóstico se basa en ciertos criterios, reflejados en los exámenes clínicos. De estos exámenes surgen las limitaciones y el grado en que se encuentra cada una de ellas en los pacientes. Para reducir el total de limitaciones a ser evaluadas, utilizamos la teoría de Conjuntos Imprecisos, esta teoría ha sido aplicada en áreas de la inteligencia artificial tales como análisis de decisiones, sistemas expertos, descubrimiento de conocimiento, clasificación con múltiples atributos. En nuestro caso se aplica para encontrar el conjunto mínimo de limitaciones o reducto que genera la misma clasificación que considerando todas las limitaciones, para ello se desarrollo un algoritmo GRASP (Greedy Randomized Adaptive Search Procedure).]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[The proper detection of patient level of dementia is important to offer the suitable treatment. The diagnosis is based on certain criteria, reflected in the clinical examinations. From these examinations emerge the limitations and the degree in which each patient is in. In order to reduce the total of limitations to be evaluated, we used the rough set theory, this theory has been applied in areas of the artificial intelligence such as decision analysis, expert systems, knowledge discovery, classification with multiple attributes. In our case this theory is applied to find the minimal limitations set or reduct that generate the same classification that considering all the limitations, to fulfill this purpose we development an algorithm GRASP (Greedy Randomized Adaptive Search Procedure).]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[demencias]]></kwd>
<kwd lng="es"><![CDATA[conjuntos imprecisos]]></kwd>
<kwd lng="es"><![CDATA[heurísticas]]></kwd>
<kwd lng="es"><![CDATA[reducción de datos]]></kwd>
<kwd lng="en"><![CDATA[dementias]]></kwd>
<kwd lng="en"><![CDATA[rough set]]></kwd>
<kwd lng="en"><![CDATA[heuristics]]></kwd>
<kwd lng="en"><![CDATA[data reduction]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[ <div style="text-align: center;"><font size="4"><span  style="font-family: verdana; font-weight: bold;">Reductos m&iacute;nimos con GRASP    <br>     <br> </span></font><font size="4"><span  style="font-family: verdana; font-weight: bold;">Minimal reducts with GRASP</span></font><br style="font-family: verdana;"> </div> <font size="2"><br style="font-family: verdana;"> </font>     <div style="text-align: justify;"><font size="2"><span  style="font-family: verdana;">Iris Iddaly M&eacute;ndez&#8211;Gurrola<sup><a  href="#autor1">*</a></sup></span></font>    <br> <font size="2"><span style="font-family: verdana;">Ana Lilia Laureano&#8211;Cruces<a href="#autor2"><sup>&#8224;</sup></a></span></font><br  style="font-family: verdana;"> <font size="2"><span style="font-family: verdana;">Javier Ram&iacute;rez&#8211;Rodr&iacute;guez<sup><a href="#autor3">&#8225;</a></sup></span></font>    <br> </div> <font size="2"><br style="font-family: verdana;"> <span style="font-family: verdana;"><a name="autor1"></a>*Posgrado en Dise&ntilde;o, L&iacute;nea: Nuevas Tecnolog&iacute;as, UAM-A y Departamento de Matem&aacute;ticas Aplicadas y Sistemas, UAM-C Artificios 40, Col. Hidalgo, Del. &Aacute;lvaro </span><span  style="font-family: verdana;">Obreg&oacute;n, M&eacute;xico, D. F. E-Mail: <a href="mailto:iddalym@yahoo.com.mx">iddalym@yahoo.com.mx</a></span><br  style="font-family: verdana;"> <span style="font-family: verdana;"><a name="autor2"></a>&#8224;Universidad Aut&oacute;noma Metropolitana, Departamento de Sistemas, Avenida San </span><span style="font-family: verdana;">Pablo 180, 02200 M&eacute;xico D. F. E-Mail: <a href="mailto:clc@correo.azc.uam.mx">clc@correo.azc.uam.mx</a></span><br  style="font-family: verdana;"> <span style="font-family: verdana;"><a name="autor3"></a>&#8225;Universidad Aut&oacute;noma Metropolitana, Departamento de Sistemas. Misma direcci&oacute;n </span><span style="font-family: verdana;">que/same address as Laureano-Cruces, E-Mail: <a href="mailto:jararo@correo.azc.uam.mx">jararo@correo.azc.uam.mx</a>    <br>     <br> <a href="#correspondencia">Direcci&oacute;n para correspondencia</a>    <br> </span>    <br> </font>     ]]></body>
<body><![CDATA[<div style="text-align: justify;"><font style="font-weight: bold;"  size="3"><span style="font-family: verdana;"></span></font> <hr style="width: 100%; height: 2px;"><font style="font-weight: bold;"  size="3"><span style="font-family: verdana;">Resumen</span></font>    <br>     <br> <font size="2"><span style="font-family: verdana;">La detecci&oacute;n adecuada del nivel de demencia de un paciente es importante para brindar el tratamiento adecuado. El diagn&oacute;stico se basa en ciertos criterios, reflejados en los ex&aacute;menes cl&iacute;nicos. De estos ex&aacute;menes surgen las limitaciones y el grado en que&nbsp; se encuentra cada una de ellas en los pacientes. Para reducir el total de limitaciones a&nbsp; ser evaluadas, utilizamos la teor&iacute;a de Conjuntos Imprecisos, esta teor&iacute;a ha sido&nbsp; aplicada en &aacute;reas de la inteligencia artificial tales como an&aacute;lisis de decisiones, sistemas&nbsp; expertos, descubrimiento de conocimiento, clasificaci&oacute;n con m&uacute;ltiples atributos. En&nbsp; nuestro caso se aplica para encontrar el conjunto m&iacute;nimo de limitaciones o reducto que&nbsp; genera la misma clasificaci&oacute;n que considerando todas las limitaciones, para ello se&nbsp; desarrollo un algoritmo GRASP (Greedy Randomized Adaptive Search Procedure).</span></font>    <br>     <br> <font size="2"><span style="font-family: verdana;"><!-- big --><span  style="font-weight: bold;">Palabras clave:</span><!-- /big --> demencias, conjuntos imprecisos, heur&iacute;sticas, reducci&oacute;n de datos.</span></font>    <br>     <br> <font style="font-weight: bold;" size="3"><span  style="font-family: verdana;">Abstract</span></font>    <br>     <br> <font size="2"><span style="font-family: verdana;">The proper detection of patient level of dementia is important to offer the suitable&nbsp; treatment. The diagnosis is based on certain criteria, reflected in the clinical&nbsp; examinations. From these examinations emerge the limitations and the degree in&nbsp; which each patient is in. In order to reduce the total of limitations to be evaluated, we&nbsp; used the rough set theory, this theory has been applied in areas of the artificial&nbsp;&nbsp; intelligence such as decision analysis, expert systems, knowledge discovery,&nbsp; classification with multiple attributes. In our case this theory is applied to find the&nbsp; minimal limitations set or reduct that generate the same classification that considering&nbsp; all the limitations, to fulfill this purpose we development an algorithm GRASP (Greedy Randomized Adaptive Search Procedure).</span></font>    <br>     ]]></body>
<body><![CDATA[<br> <font size="2"><span style="font-family: verdana;"><!-- big --><span  style="font-weight: bold;">Keywords: </span><!-- /big -->dementias, rough set, heuristics, data reduction.</span></font><br  style="font-family: verdana;">     <br> <font size="2"><span style="font-family: verdana;"><span  style="font-weight: bold;">Mathematics Subject Classification:</span> 68T20, 68T30, 68T37.    <br>     <br> </span></font> <hr style="width: 100%; height: 2px;"><font size="2"><span  style="font-family: verdana;">Ver contenido disponible en pdf</span></font>    <br> <font size="2"><span style="font-family: verdana;"></span></font><font  style="font-weight: bold;" size="3"><span style="font-family: verdana;"></span></font> <hr style="width: 100%; height: 2px;"><font style="font-weight: bold;"  size="3"><span style="font-family: verdana;">Referencias</span></font>    <br>     <!-- ref --><br> <font size="2"><span style="font-family: verdana;">[1] Bjorvand, A.T. (1997) &#8220;Rough enough &#8211; A system supporting the rough sets approach&#8221;, Sixth Scandinavian Conference on Artificial Intelligence, Helsinki, Finland: 290&#8211;291.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1952099&pid=S1409-2433201100010001100001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></span></font><br  style="font-family: verdana;">     <!-- ref --><br> <font size="2"><span style="font-family: verdana;">[2] Bjorvand, A.T.; Komorowski, J. (1997) &#8220;Practical applications of genetic algorithms for efficient reduct computation&#8221;, Wissenschaft &amp; Technik Verlag 4: 601&#8211;    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1952101&pid=S1409-2433201100010001100002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref -->606.</span></font>    ]]></body>
<body><![CDATA[<br>     <!-- ref --><br> <font size="2"><span style="font-family: verdana;">[3] Lezak, M.D.; Howieson, D.B.; Loring, D.D.; Hannay, H.J.; Fisher, J.S. (2004) Neuropsychological Assessment. Oxford University Press, New York.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1952104&pid=S1409-2433201100010001100003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></span></font><br style="font-family: verdana;">     <!-- ref --><br> <font size="2"><span style="font-family: verdana;">[4] M&eacute;ndez-Gurrola, I.I.; Laureano-Cruces, A.L.; S&aacute;nchez de Antu&ntilde;ano, J.; de Arriga- G&oacute;mez, F. (2009) &#8220;Aplicaciones de apoyo a pacientes con Alzheimer&#8221; , XXII Congreso&nbsp; Nacional y VIII Congreso Internacional de Inform&aacute;tica y Computaci&oacute;n de la ANIEI,&nbsp; Ensenada, Baja California: 337&#8211;342.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1952106&pid=S1409-2433201100010001100004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></span></font>    <br>     <!-- ref --><br> <font size="2"><span style="font-family: verdana;">[5] Pawlak, Z.; Skowron, A. (2007) &#8220;Rudiments of rough sets&#8221;, Information Sciences 177(1): 3&#8211;27.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1952109&pid=S1409-2433201100010001100005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></span></font>    <br>     <!-- ref --><br> <font size="2"><span style="font-family: verdana;">[6] Resende, M.G.C.; Gonz&aacute;lez Velarde, J.L. (2003) &#8220;GRASP: Greedy randomized&nbsp; adaptive search procedures&#8221;, Revista Iberoamericana de Inteligencia Artificial 19: 61&#8211;76.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1952112&pid=S1409-2433201100010001100006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></span></font>    <!-- ref --><br> <br style="font-family: verdana;"> <font size="2"><span style="font-family: verdana;">[7] Segovia-Vargas, M.J.; Gil-Fana, J.A.; Heras-Mart&iacute;nez, A.; Vilar-Za&ntilde;on, J.L. (2002) &#8220;Predicci&oacute;n de insolvencias con el m&eacute;todo Rouge Set&#8221;, X Jornadas de Asepuma, Madrid.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1952114&pid=S1409-2433201100010001100007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></span></font>    <br>     <!-- ref --><br> <font size="2"><span style="font-family: verdana;">[8] Wr&oacute;blewski, J. (1995) &#8220;Finding minimal reducts using genetic algorithm&#8221;, Proc. of the Second Annual Join Conference on Information Sciences, Wrightsville Beach, NC: 186&#8211;189.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=1952117&pid=S1409-2433201100010001100008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><br>     <br>     <br> </span></font>     <div style="text-align: left;"><font size="2"><span  style="font-family: verdana;"><a name="correspondencia"></a>Correspondencia a: </span></font><font size="2"><span style="font-family: verdana;">Iris Iddaly M&eacute;ndez&#8211;Gurrola. </span></font><font size="2"><span  style="font-family: verdana;">Posgrado en Dise&ntilde;o, L&iacute;nea: Nuevas Tecnolog&iacute;as, UAM-A y Departamento de Matem&aacute;ticas Aplicadas y Sistemas, UAM-C Artificios 40, Col. Hidalgo, Del. &Aacute;lvaro </span><span  style="font-family: verdana;">Obreg&oacute;n, M&eacute;xico, D. F. E-Mail: <a href="mailto:iddalym@yahoo.com.mx">iddalym@yahoo.com.mx</a></span></font>    <br> <font size="2"><span style="font-family: verdana;"></span></font><font  size="2"><span style="font-family: verdana;">Ana Lilia Laureano&#8211;Cruces. </span></font><font size="2"><span  style="font-family: verdana;">Universidad Aut&oacute;noma Metropolitana, Departamento de Sistemas, Avenida San </span><span style="font-family: verdana;">Pablo 180, 02200 M&eacute;xico D. F. E-Mail: <a href="mailto:clc@correo.azc.uam.mx">clc@correo.azc.uam.mx</a></span></font> </div> </div>     ]]></body>
<body><![CDATA[<div style="text-align: left;"><font size="2"><span  style="font-family: verdana;">Javier Ram&iacute;rez&#8211;Rodr&iacute;guez. </span></font><font size="2"><span  style="font-family: verdana;">Universidad Aut&oacute;noma Metropolitana, Departamento de Sistemas. Misma direcci&oacute;n </span><span style="font-family: verdana;">que/same address as Laureano-Cruces, E-Mail: <a href="mailto:jararo@correo.azc.uam.mx">jararo@correo.azc.uam.mx</a></span></font></div>     <div style="text-align: center;"><font size="2"><span  style="font-family: verdana;"></span></font> <hr style="width: 100%; height: 2px;"><font size="2"><span  style="font-family: verdana;">Received: 18 Feb 2010; Revised: 20 Aug 2010; Accepted: 26 Nov 2010</span></font>    <br> </div>      ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bjorvand]]></surname>
<given-names><![CDATA[A.T]]></given-names>
</name>
</person-group>
<source><![CDATA[Rough enough - A system supporting the rough sets approach]]></source>
<year>1997</year>
<conf-name><![CDATA[Sixth Scandinavian Conference on Artificial Intelligence]]></conf-name>
<conf-loc>Helsinki </conf-loc>
<page-range>290-291</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bjorvand]]></surname>
<given-names><![CDATA[A.T]]></given-names>
</name>
<name>
<surname><![CDATA[Komorowski]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Practical applications of genetic algorithms for efficient reduct computation]]></article-title>
<source><![CDATA[Wissenschaft & Technik Verlag]]></source>
<year>1997</year>
<volume>4</volume>
<page-range>601-606</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lezak]]></surname>
<given-names><![CDATA[M.D]]></given-names>
</name>
<name>
<surname><![CDATA[Howieson]]></surname>
<given-names><![CDATA[D.B]]></given-names>
</name>
<name>
<surname><![CDATA[Loring]]></surname>
<given-names><![CDATA[D.D]]></given-names>
</name>
<name>
<surname><![CDATA[Hannay]]></surname>
<given-names><![CDATA[H.J]]></given-names>
</name>
<name>
<surname><![CDATA[Fisher]]></surname>
<given-names><![CDATA[J.S]]></given-names>
</name>
</person-group>
<source><![CDATA[Neuropsychological Assessment]]></source>
<year>2004</year>
<publisher-loc><![CDATA[^eNew York New York]]></publisher-loc>
<publisher-name><![CDATA[Oxford University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Méndez-Gurrola]]></surname>
<given-names><![CDATA[I.I]]></given-names>
</name>
<name>
<surname><![CDATA[Laureano-Cruces]]></surname>
<given-names><![CDATA[A.L]]></given-names>
</name>
<name>
<surname><![CDATA[Sánchez de Antuñano]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[de Arriga-Gómez]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
</person-group>
<source><![CDATA[Aplicaciones de apoyo a pacientes con Alzheimer]]></source>
<year>2009</year>
<conf-name><![CDATA[XXII Congreso Nacional y VIII Congreso Internacional de Informática y Computación de la ANIEI]]></conf-name>
<conf-loc>Ensenada Baja California</conf-loc>
<page-range>337-342</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pawlak]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
<name>
<surname><![CDATA[Skowron]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Rudiments of rough sets]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2007</year>
<volume>177</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>3-27</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Resende]]></surname>
<given-names><![CDATA[M.G.C]]></given-names>
</name>
<name>
<surname><![CDATA[González Velarde]]></surname>
<given-names><![CDATA[J.L]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[GRASP: Greedy randomized adaptive search procedures]]></article-title>
<source><![CDATA[Revista Iberoamericana de Inteligencia Artificial]]></source>
<year>2003</year>
<volume>19</volume>
<page-range>61-76</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Segovia-Vargas]]></surname>
<given-names><![CDATA[M.J]]></given-names>
</name>
<name>
<surname><![CDATA[Gil-Fana]]></surname>
<given-names><![CDATA[J.A]]></given-names>
</name>
<name>
<surname><![CDATA[Heras-Martínez]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Vilar-Zañon]]></surname>
<given-names><![CDATA[J.L]]></given-names>
</name>
</person-group>
<source><![CDATA[Predicción de insolvencias con el método Rouge Set]]></source>
<year>2002</year>
<conf-name><![CDATA[X Jornadas de Asepuma]]></conf-name>
<conf-loc>Madrid </conf-loc>
</nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wróblewski]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<source><![CDATA[Finding minimal reducts using genetic algorithm]]></source>
<year>1995</year>
<conf-name><![CDATA[Second Annual Join Conference on Information Sciences]]></conf-name>
<conf-loc>Wrightsville Beach NC</conf-loc>
<page-range>186-189</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
