<?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-55462014000200006</article-id>
<article-id pub-id-type="doi">10.13053/CyS-18-2-2014-033</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Attribute and Case Selection for NN Classifier through Rough Sets and Naturally Inspired Algorithms]]></article-title>
<article-title xml:lang="es"><![CDATA[Selección de atributos y casos para el clasificador NN a través de conjuntos aproximados y algoritmos inspirados en la naturaleza]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Villuendas-Rey]]></surname>
<given-names><![CDATA[Yenny]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Garcia-Lorenzo]]></surname>
<given-names><![CDATA[Maria Matilde]]></given-names>
</name>
<xref ref-type="aff" rid="A02"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,University of Ciego de Avila Department of Computer Science ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Cuba</country>
</aff>
<aff id="A02">
<institution><![CDATA[,University Marta Abreu of Las Villas Department of Computer Science ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Cuba</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2014</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2014</year>
</pub-date>
<volume>18</volume>
<numero>2</numero>
<fpage>295</fpage>
<lpage>311</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462014000200006&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-55462014000200006&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-55462014000200006&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Supervised classification is one of the most active research fields in the Artificial Intelligence community. Nearest Neighbor (NN) is one of the simplest and most consistently accurate approaches to supervised classification. The training set preprocessing is essential for obtaining high quality classification results. This paper introduces an attribute and case selection algorithm using a hybrid Rough Set Theory and naturally inspired approach to improve the NN performance. The proposed algorithm deals with mixed and incomplete, as well as imbalanced datasets. Its performance was tested over repository databases, showing high classification accuracy while keeping few cases and attributes.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[La clasificación supervisada constituye una de las áreas de investigación más activas dentro de la Inteligencia Artificial. La regla del vecino más cercano (NN) es una de las más simples y efectivas para la clasificación supervisada. El pre-procesamiento del conjunto de entrenamiento es esencial para obtener clasificaciones de alta calidad. En este artículo se introduce un nuevo algoritmo de selección de atributos y casos que utiliza un enfoque híbrido basado en los Conjuntos Aproximados y los algoritmos inspirados en la naturaleza para mejorar el desempeño de clasificadores NN. El algoritmo propuesto permite el manejo de conjuntos de datos mezclados, incompletos, y no balanceados. El desempeño de dicho algoritmo se analizó utilizando bases de datos de repositorio, mostrando una alta eficacia del clasificador, utilizando solamente pocos casos y atributos.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Nearest neighbor]]></kwd>
<kwd lng="en"><![CDATA[case selection]]></kwd>
<kwd lng="en"><![CDATA[attribute selection]]></kwd>
<kwd lng="es"><![CDATA[Vecino más cercano]]></kwd>
<kwd lng="es"><![CDATA[selección de casos]]></kwd>
<kwd lng="es"><![CDATA[selección de atributos]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[  	    <p align="justify"><font face="verdana" size="4">Art&iacute;culos regulares</font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="center"><font face="verdana" size="4"><b>Attribute and Case Selection for NN Classifier through Rough Sets and Naturally Inspired Algorithms</b></font></p>  	    <p align="center"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="center"><font face="verdana" size="3"><b>Selecci&oacute;n de atributos y casos para el clasificador NN a trav&eacute;s de conjuntos aproximados y algoritmos inspirados en la naturaleza</b></font></p>  	    <p align="center"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="center"><font face="verdana" size="2"><b>Yenny Villuendas&#45;Rey<sup>1</sup> and Maria Matilde Garcia&#45;Lorenzo<sup>2</sup></b><sup></sup></font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><sup><i>1</i></sup> <i>Department of Computer Science, University of Ciego de Avila,</i> <i>Cuba</i>. <a href="mailto:yenny@informatica.unica.cu">yenny@informatica.unica.cu</a></font></p>  	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2"><sup><i>2</i></sup> <i>Department of Computer Science, University Marta Abreu of Las Villas,</i> <i>Cuba.</i> <a href="mailto:mmgarcia@uclv.edu.cu">mmgarcia@uclv.edu.cu</a></font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Abstract</b></font></p>  	    <p align="justify"><font face="verdana" size="2">Supervised classification is one of the most active research fields in the Artificial Intelligence community. Nearest Neighbor (NN) is one of the simplest and most consistently accurate approaches to supervised classification. The training set preprocessing is essential for obtaining high quality classification results. This paper introduces an attribute and case selection algorithm using a hybrid Rough Set Theory and naturally inspired approach to improve the NN performance. The proposed algorithm deals with mixed and incomplete, as well as imbalanced datasets. Its performance was tested over repository databases, showing high classification accuracy while keeping few cases and attributes.</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Keywords:</b> Nearest neighbor, case selection, attribute selection.</font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Resumen</b></font></p>  	    <p align="justify"><font face="verdana" size="2">La clasificaci&oacute;n supervisada constituye una de las &aacute;reas de investigaci&oacute;n m&aacute;s activas dentro de la Inteligencia Artificial. La regla del vecino m&aacute;s cercano (NN) es una de las m&aacute;s simples y efectivas para la clasificaci&oacute;n supervisada. El pre&#45;procesamiento del conjunto de entrenamiento es esencial para obtener clasificaciones de alta calidad. En este art&iacute;culo se introduce un nuevo algoritmo de selecci&oacute;n de atributos y casos que utiliza un enfoque h&iacute;brido basado en los Conjuntos Aproximados y los algoritmos inspirados en la naturaleza para mejorar el desempe&ntilde;o de clasificadores NN. El algoritmo propuesto permite el manejo de conjuntos de datos mezclados, incompletos, y no balanceados. El desempe&ntilde;o de dicho algoritmo se analiz&oacute; utilizando bases de datos de repositorio, mostrando una alta eficacia del clasificador, utilizando solamente pocos casos y atributos.</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Palabras clave:</b> Vecino m&aacute;s cercano, selecci&oacute;n de casos, selecci&oacute;n de atributos.</font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2"><a href="/pdf/cys/v18n2/v18n2a6.pdf" target="_blank">DESCARGAR ART&Iacute;CULO EN FORMATO PDF</a></font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>References</b></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>1.&nbsp;Cover, T. &amp; Hart, P. (1967).</b> Nearest neighbor pattern classification. <i>IEEE Transactions on Information Theory.</i> 13(1), 21&#45;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=2066933&pid=S1405-5546201400020000600001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>2.&nbsp;Wilson, D.R. &amp; Martinez, T.R. (1997).</b> Improved Heterogeneous Distance Functions. <i>Journal of Artificial Intelligence Research,</i> 6(1), 1 &#45;34.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066935&pid=S1405-5546201400020000600002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>3.&nbsp;Zhang, B. &amp; Shrihari, S.N. (2004).</b> Fast k&#45;nearest neighbors Classification using cluster&#45;based trees. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence,</i> 26(4), 525&#45;528.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066937&pid=S1405-5546201400020000600003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>4.&nbsp;Liu, H., Motoda, H., Setiono, R., &amp; Zhao, Z.</b> <b>(2010).</b> Feature selection: an ever evolving frontier in data mining. <i>JMLR Workshop and Conference Proceedings,</i> Hyderabad, India, 10, pp. 4&#45;13.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066939&pid=S1405-5546201400020000600004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>5.&nbsp;Garc&iacute;a, S., Derrac, J., Cano, J., &amp; Herrera, F.</b> <b>(2012).</b> Prototype selection for nearest neighbor classification: Taxonomy and empirical study. <i>IEEE Transactions on Pattern Analysis and Machine</i> <i>Intelligence,</i> 34(3), 417&#45;435.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066941&pid=S1405-5546201400020000600005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>6.&nbsp;Kuncheva, L.I. &amp; Jain, L.C. (1999).</b> Nearest neighbor classifier: Simultaneous editing and feature selection. <i>Pattern Recognition Letters,</i> 20(11&#45;13), 1149&#45;1156.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066943&pid=S1405-5546201400020000600006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>7.&nbsp;Derrac, J., Cornelis, C., Garc&iacute;a, S., &amp; Herrera, F. (2012).</b> Enhancing evolutionary instance selection algorithms by means of fuzzy rough set based feature selection. <i>Information Sciences,</i> 186(1), 73&#45;92.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066945&pid=S1405-5546201400020000600007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>8.&nbsp;Caballero, Y., Bello, R., Salgado, Y., &amp; Garc&iacute;a, M.M. (2007).</b> A method to edit training sets based on rough sets. <i>International Journal of Computational Intelligence Research,</i> 3(3), 219229.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066947&pid=S1405-5546201400020000600008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>9.&nbsp;Fan, H. &amp; Zhong, Y. (2012).</b> A rough set approach to feature selection based on wasp swarm optimization. <i>Journal of Computational Information</i> <i>Systems,</i> 8(3), 1037&#45;1045.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066949&pid=S1405-5546201400020000600009&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>10.&nbsp;Pawlak, Z. (1982).</b> Rough sets. <i>International Journal of computer and Information Sciences,</i> 11(5), 341 &#45;356.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066951&pid=S1405-5546201400020000600010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>11.&nbsp;Hu, Q., Yu, D., Liu, J., &amp; Wu, C. (2008).</b> Neighborhood rough set based heterogeneous feature selection. <i>Information Sciences,</i> 178(18), 3577&#45;3594.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066953&pid=S1405-5546201400020000600011&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>12.&nbsp;Filiberto, Y., Caballero, Y., Larrua, R., &amp; Bello, R. (2010).</b> A method to build similarity relations into extended rough set theory. <i>10<sup>th</sup> International conference on Intelligent Systems Design and Applications (ISDA 2010),</i> Cairo, Egypt, 13141319.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066955&pid=S1405-5546201400020000600012&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>13.&nbsp;Villuendas&#45;Rey, Y., Caballero&#45;Mota, Y., &amp; Garc&iacute;a&#45;Lorenzo, M.M. (2012).</b> Using Rough Sets and Maximum Similarity Graphs for Nearest Prototype Classification. <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. Lecture Notes in Computer Science,</i> 7441, 300&#45;307.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066957&pid=S1405-5546201400020000600013&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>14.&nbsp;Jensen, R. &amp; Cornelis, C. (2010).</b> Fuzzy&#45;rough instance selection. <i>IEEE World Congress on Computational Intelligence (WCCI 2010),</i> Barcelona, Spain, 1776&#45;1782.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066959&pid=S1405-5546201400020000600014&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>15.&nbsp;Bell, D.A. &amp; Guan, J.W. (1998).</b> Computational methods for rough classification and discovery. <i>Journal of the American Society for Information Science &#45; Special issue: knowledge discovery and data mining,</i> 49(5), 403&#45;414.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066961&pid=S1405-5546201400020000600015&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>16.&nbsp;Santiesteban, Y. &amp; Pons&#45;Porrata, A. (2003).</b> LEX: A new algorithm to calculate typical testors. Mathematics Sciences Journal, <b>21,</b> 31&#45;40.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066963&pid=S1405-5546201400020000600016&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>17.&nbsp;Suguna, N. &amp; Thanushkodi, K. (2010).</b> A novel rough set reduct algorithms for medical domains based on bee colony optimization. <i>Journal of Computing,</i> 2(6), 49&#45;54.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066965&pid=S1405-5546201400020000600017&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>18.&nbsp;Banati, H. &amp; Bajaj, M. (2011).</b> Fire fly based feature selection approach. <i>International Journal of Computer Science Issues,</i> 8(4), 473&#45;480.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066967&pid=S1405-5546201400020000600018&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>19.&nbsp;Camps&#45;Echevarr&iacute;a, L., Llanes&#45;Santiago, O., Silva&#45;Neto, A.J., &amp; Fraga de Campos&#45;Velho, H. (2014).</b> An Approach to Fault Diagnosis Using Meta&#45;Heuristics: a New Variant of the Differential Evolution Algorithm. <i>Computaci&oacute;n y Sistemas,</i> 8(4), 473&#45;480.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066969&pid=S1405-5546201400020000600019&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>20.&nbsp;Boluf&eacute;&#45;R&ouml;hler, A., Otero, J.M., &amp; Fiol&#45;Gonz&aacute;lez, S. (2014).</b> Traffic Flow Estimation Using Ant Colony Optimization Algorithms. <i>Computaci&oacute;n y Sistemas,</i> 18(1), 37&#45;50.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066971&pid=S1405-5546201400020000600020&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>21.&nbsp;Kuncheva, L.I. (1995).</b> Editing for the k&#45;nearest neighbors rule by a genetic algorithm. <i>Pattern Recognition Letters,</i> 16(1995), 809&#45;814.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066973&pid=S1405-5546201400020000600021&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>22.&nbsp;Kuncheva, L.I. &amp; Bezdek, C.J. (1998).</b> Nearest prototype classification: clustering, genetic algorithms or random search. <i>IEEE Transactions on Systems, Man and Cybernetics, Part C: Applications and Reviews,</i> 28(1), 160&#45;164.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066975&pid=S1405-5546201400020000600022&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>23.&nbsp;Gagne, C. &amp; Parizeau, M. (2007).</b> Coevolution of nearest neighbor classifiers. <i>International Journal of Pattern Recognition and Artificial Intelligence,</i> 21(5), 921 &#45;946.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066977&pid=S1405-5546201400020000600023&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>24.&nbsp;Siedlecki, W. &amp; Skalansky, J. (1989).</b> A note on genetic algorithms for large&#45;scale feature selection. <i>Pattern Recognition Letters,</i> 10(5), 335&#45;347.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066979&pid=S1405-5546201400020000600024&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>25.&nbsp;Vafaie, H. &amp; De Jong, K. (1992).</b> Genetic algorithms as a tool for feature selection in machine learning. <i>Fourth International Conference on Tools with Artificial Intelligence,</i> Arlington, VA, 200&#45;203.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066981&pid=S1405-5546201400020000600025&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>26.&nbsp;Yang, J. &amp; Honavar, V. (1998).</b> Feature subset selection using a genetic algorithm. <i>IEEE Intelligent Systems and their Applications,</i> 13(2), 44&#45;49.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066983&pid=S1405-5546201400020000600026&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>27.&nbsp;Olveira, L.S., Benahmed, N., Sabourin, R., &amp; Bortolozzi, F. (2001).</b> Feature subset selection using genetic algorithms for handwritten digit recognition. <i>14<sup>th</sup> Brazilian symposium on Computer Graphics and Image Processing,</i> Florian&oacute;polis, Brazil, 362&#45;369.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066985&pid=S1405-5546201400020000600027&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>28.&nbsp;Sahan, S., Polat, k., Kodaz, H., &amp; Gunes, S. (2007).</b> A new hybrid method based on fuzzy artificial immune system and k&#45;nn algorithm for breast cancer diagnosis. <i>Computers in Biology and</i> <i>Medicine,</i> 37(3), 415&#45;423.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066987&pid=S1405-5546201400020000600028&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>29.&nbsp;Garain, U. (2008).</b> Prototype reduction using an artificial immune model. <i>Pattern analysis &amp; Applications,</i> 11(3&#45;4), 353&#45;363.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066989&pid=S1405-5546201400020000600029&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>30.&nbsp;Ahmad, S.S.S. &amp; Pedrycz, W. (2011).</b> Feature and Instance selection via cooperative PSO. <i>2011 IEEE International Conference on Systems, Man and Cybernetic,</i> Anchorage, AK, 2127&#45;2132.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066991&pid=S1405-5546201400020000600030&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>31.&nbsp;Mohamed, S.S.,</b> <b>Youssef,</b> <b>A.M.,</b> <b>El&#45;Saadany,</b> <b>E.F., &amp;</b> <b>Salama,</b> <b>M.M.A. (2005).</b> Artificial life feature selection techniques for prostate cancer diagnosis using TRUS images. <i>Image Analysis and Recognition. Lecture Notes in Computer Science,</i> 3656, 903&#45;913.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066993&pid=S1405-5546201400020000600031&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>32.&nbsp;Polat, K.,</b> <b>Sahan,</b> <b>S.,</b> <b>Kodaz,</b> <b>H., &amp;</b> <b>G&uuml;nes,</b> <b>S. (2005).</b> A new classification method for breast cancer diagnosis: feature selection artificial immune recognition system (FS&#45;AIRS). <i>Advances in Natural Computation. Lecture Notes in Computer Science,</i> 3611, 830&#45;838.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066995&pid=S1405-5546201400020000600032&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>33.&nbsp;Zainal, A., Maarof, M.A., &amp; Shamsuddin, S.M. (2005).</b> Feature selection using Rough&#45;DPSO in anomaly intrusion detection. <i>Computational Science and Its Applications&#45;ICCSA 2007. Lecture Notes in Computer Science,</i> 4705, 512&#45;524.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066997&pid=S1405-5546201400020000600033&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>34.&nbsp;Bello, R., Now&eacute;, A., Caballero, Y., G&oacute;mez, Y.Y., &amp; Vrancx, P. (2005).</b> Using Ant colony system meta&#45;heuristic and Rough Set Theory for feature selection. <i>MIC 2005: 6<sup>th</sup> Metaheuristics International Conference,</i> Vienna, Austria.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2066999&pid=S1405-5546201400020000600034&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>35.&nbsp;Ruiz&#45;Shulcloper, J. &amp; Abidi, M.A. (2002).</b> Logical combinatorial pattern recognition: A Review. <i>Recent Research Developments in Pattern Recognition,</i> Kerala, India, 133&#45;176.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2067001&pid=S1405-5546201400020000600035&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>36.&nbsp;Garner, S.R. (1995).</b> WEKA: The Waikato Environment for Knowledge Analysis. <i>Proceedings of the New Zealand Computer Science Research Students Conference,</i> Hamilton Beach, New Zealand, 57&#45;64.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2067003&pid=S1405-5546201400020000600036&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>37.&nbsp;Basturk, B. &amp; Karaboga, D. (2006).</b> An Artificial Bee Colony (ABC) algorithm for numeric function optimization. <i>IEEE Swarm Intelligence Symposium 2006,</i> Indianapolis, Indiana, USA.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2067005&pid=S1405-5546201400020000600037&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>38.&nbsp;Karaboga, D. (2005).</b> <i>An idea based on honey bee swarm for numerical optimization</i> (Technical Report TR06). Kayseri, Turqu&iacute;a: Erciyes University.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2067007&pid=S1405-5546201400020000600038&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>39.&nbsp;Karaboga, D. &amp; Basturk, B. (2007).</b> A powerful and efficient algorithm for numerical function optimization: Artificial Bee Colony (ABC) algorithm. <i>Journal of Global Optimization,</i> 39(3), 459&#45;471.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2067009&pid=S1405-5546201400020000600039&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>40.&nbsp;Garc&iacute;a&#45;Borroto, M. &amp; Ruiz&#45;Shulcloper, J. (2005).</b> Selecting Prototypes in Mixed Incomplete Data. <i>Progress in Pattern Recognition, Image Analysis and Applications. Lecture Notes in Computer Science,</i> 3773, 450&#45;459.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2067011&pid=S1405-5546201400020000600040&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>41.&nbsp;Skalak, D.B. (1994).</b> Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms. <i>Eleventh International</i> <i>Conference on Machine Learning.</i> New Brunswick, NJ, USA, 293&#45;301.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2067013&pid=S1405-5546201400020000600041&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>42.&nbsp;Ishibushi, H. &amp; Nakashima, T. (1999).</b> Evolution of reference sets in nearest neighbor classification. <i>Simulated Evolution and Learning. Lecture Notes on Computer Science,</i> 1585, 82&#45;89.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2067015&pid=S1405-5546201400020000600042&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>43.&nbsp;Ahn, H. &amp; Kim, K.J. (2009).</b> Global optimization of case&#45;based reasoning for breast cytology diagnosis. <i>Expert Systems with Applications,</i> 36(1), 724&#45;734.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2067017&pid=S1405-5546201400020000600043&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>44.&nbsp;Ahn, H., Kim, K.J., &amp; Han, I. (2007).</b> A case&#45;based reasoning system with the two&#45;dimensional reduction technique for customer classification. <i>Expert Systems with Applications,</i> 32(4), 1011 &#45; 1019.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2067019&pid=S1405-5546201400020000600044&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>45.&nbsp;Rozsypal, A. &amp; Kubat, M. (2003).</b> Selecting representative examples and attributes by a genetic algorithm. <i>Intelligent Data Analysis,</i> 7(4), 291 &#45;304.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2067021&pid=S1405-5546201400020000600045&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>46.&nbsp;Ros, F.,</b> <b>Guillaume,</b> <b>S.,</b> <b>Pintore,</b> <b>M., &amp;</b> <b>Chr&eacute;tien,</b> <b>J.R. (2008).</b> Hybrid genetic algorithm for dual selection. <i>Pattern Analysis and Applications,</i> 11(2), 179&#45;198.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2067023&pid=S1405-5546201400020000600046&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>47.&nbsp;Derrac, J.,</b> <b>Verbiest,</b> <b>N.,</b> <b>Garc&iacute;a,</b> <b>S.,</b> <b>Cornelis,</b> <b>C.,</b> <b>&amp; Herrera,</b> <b>F. (2013).</b> On the use of evolutionary feature selection for improving fuzzy rough set based prototype selection. <i>Soft Computing,</i> 17(2), 223&#45;238.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2067025&pid=S1405-5546201400020000600047&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>48.&nbsp;Dasarathy, B.V. &amp; S&aacute;nchez, J.S. (2000).</b> Concurrent Feature and Prototype Selection in the Nearest Neighbor based Decision Process. <i>4<sup>th</sup> World Multiconference on Systems, Cybernetics and Informatics,</i> Orlando, USA, 628&#45;633.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2067027&pid=S1405-5546201400020000600048&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>49.&nbsp;Kittler, J. (1978).</b> Feature set search algorithms. <i>Pattern recognition and signal processing</i> (41 &#45;60), The Netherlands: Sijthoff and Noordhoff.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2067029&pid=S1405-5546201400020000600049&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>50.&nbsp;Toussaint, G. (2002).</b> Proximity Graphs for Nearest Neighbor Decision Rules: Recent Progress. <i>34<sup>th</sup> Symposium on the INTERFACE,</i> 17&#45;20.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2067031&pid=S1405-5546201400020000600050&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>51.&nbsp;Dasarathy, B.V. (1994).</b> Minimal consistent set (MCS) identification for optimal nearest neighbor decision systems design. <i>IEEE Transactions on Systems, Man and Cybernetics,</i> 24(3), 511 &#45;517.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2067033&pid=S1405-5546201400020000600051&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>52. Villuendas&#45;Rey, Y.,</b> <b>Garc&iacute;a&#45;Borroto,</b> <b>M.,</b> <b>Medina&#45;P&eacute;rez,</b> <b>M.A., &amp;</b> <b>Ruiz&#45;Shulcloper,</b> <b>J. (2006).</b> Simultaneous features and objects selection for Mixed and Incomplete data. <i>Progress in Pattern Recognition, Image Analysis and Applications. Lecture Notes on Computer Science,</i> 4225, 597&#45;605.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2067035&pid=S1405-5546201400020000600052&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cover]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Hart]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Nearest neighbor pattern classification]]></article-title>
<source><![CDATA[IEEE Transactions on Information Theory]]></source>
<year>1967</year>
<volume>13</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>21-27</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[Wilson]]></surname>
<given-names><![CDATA[D.R.]]></given-names>
</name>
<name>
<surname><![CDATA[Martinez]]></surname>
<given-names><![CDATA[T.R.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Improved Heterogeneous Distance Functions]]></article-title>
<source><![CDATA[Journal of Artificial Intelligence Research]]></source>
<year>1997</year>
<volume>6</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1 -34</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Shrihari]]></surname>
<given-names><![CDATA[S.N.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Fast k-nearest neighbors Classification using cluster-based trees]]></article-title>
<source><![CDATA[IEEE Transactions on Pattern Analysis and Machine Intelligence]]></source>
<year>2004</year>
<volume>26</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>525-528</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Motoda]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Setiono]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhao]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<source><![CDATA[Feature selection: an ever evolving frontier in data mining. JMLR Workshop and Conference Proceedings]]></source>
<year>2010</year>
<page-range>4-13</page-range><publisher-loc><![CDATA[Hyderabad ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[García]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Derrac]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Cano]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Herrera]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Prototype selection for nearest neighbor classification: Taxonomy and empirical study]]></article-title>
<source><![CDATA[IEEE Transactions on Pattern Analysis and Machine Intelligence]]></source>
<year>2012</year>
<volume>34</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>417-435</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[Kuncheva]]></surname>
<given-names><![CDATA[L.I.]]></given-names>
</name>
<name>
<surname><![CDATA[Jain]]></surname>
<given-names><![CDATA[L.C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Nearest neighbor classifier: Simultaneous editing and feature selection]]></article-title>
<source><![CDATA[Pattern Recognition Letters]]></source>
<year>1999</year>
<volume>20</volume>
<numero>11-13</numero>
<issue>11-13</issue>
<page-range>1149-1156</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Derrac]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Cornelis]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[García]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Herrera]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Enhancing evolutionary instance selection algorithms by means of fuzzy rough set based feature selection]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2012</year>
<volume>186</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>73-92</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Caballero]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Bello]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Salgado]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[García]]></surname>
<given-names><![CDATA[M.M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A method to edit training sets based on rough sets]]></article-title>
<source><![CDATA[International Journal of Computational Intelligence Research]]></source>
<year>2007</year>
<volume>3</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>219229</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fan]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhong]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A rough set approach to feature selection based on wasp swarm optimization]]></article-title>
<source><![CDATA[Journal of Computational Information Systems]]></source>
<year>2012</year>
<volume>8</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>1037-1045</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pawlak]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Rough sets]]></article-title>
<source><![CDATA[International Journal of computer and Information Sciences]]></source>
<year>1982</year>
<volume>11</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>341 -356</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hu]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Yu]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Neighborhood rough set based heterogeneous feature selection]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2008</year>
<volume>178</volume>
<numero>18</numero>
<issue>18</issue>
<page-range>3577-3594</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Filiberto]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Caballero]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Larrua]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Bello]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[A method to build similarity relations into extended rough set theory. 10th International conference on Intelligent Systems Design and Applications (ISDA 2010)]]></source>
<year>2010</year>
<page-range>13141319</page-range><publisher-loc><![CDATA[Cairo ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Villuendas-Rey]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Caballero-Mota]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[García-Lorenzo]]></surname>
<given-names><![CDATA[M.M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Using Rough Sets and Maximum Similarity Graphs for Nearest Prototype Classification. Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications]]></article-title>
<source><![CDATA[Lecture Notes in Computer Science]]></source>
<year>2012</year>
<volume>7441</volume>
<page-range>300-307</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jensen]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Cornelis]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Fuzzy-rough instance selection. IEEE World Congress on Computational Intelligence (WCCI 2010)]]></source>
<year>2010</year>
<page-range>1776-1782</page-range><publisher-loc><![CDATA[Barcelona ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bell]]></surname>
<given-names><![CDATA[D.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Guan]]></surname>
<given-names><![CDATA[J.W.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Computational methods for rough classification and discovery]]></article-title>
<source><![CDATA[Journal of the American Society for Information Science - Special issue: knowledge discovery and data mining]]></source>
<year>1998</year>
<volume>49</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>403-414</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Santiesteban]]></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="en"><![CDATA[LEX: A new algorithm to calculate typical testors]]></article-title>
<source><![CDATA[Mathematics Sciences Journal]]></source>
<year>2003</year>
<volume>21</volume>
<page-range>31-40</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Suguna]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Thanushkodi]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A novel rough set reduct algorithms for medical domains based on bee colony optimization]]></article-title>
<source><![CDATA[Journal of Computing]]></source>
<year>2010</year>
<volume>2</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>49-54</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Banati]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Bajaj]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Fire fly based feature selection approach]]></article-title>
<source><![CDATA[International Journal of Computer Science Issues]]></source>
<year>2011</year>
<volume>8</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>473-480</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Camps-Echevarría]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Llanes-Santiago]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Silva-Neto]]></surname>
<given-names><![CDATA[A.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Fraga de Campos-Velho]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[An Approach to Fault Diagnosis Using Meta-Heuristics: a New Variant of the Differential Evolution Algorithm]]></article-title>
<source><![CDATA[Computación y Sistemas]]></source>
<year>2014</year>
<volume>8</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>473-480</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bolufé-Röhler]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Otero]]></surname>
<given-names><![CDATA[J.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Fiol-González]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Traffic Flow Estimation Using Ant Colony Optimization Algorithms]]></article-title>
<source><![CDATA[Computación y Sistemas]]></source>
<year>2014</year>
<volume>18</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>37-50</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kuncheva]]></surname>
<given-names><![CDATA[L.I.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Editing for the k-nearest neighbors rule by a genetic algorithm]]></article-title>
<source><![CDATA[Pattern Recognition Letters]]></source>
<year>1995</year>
<volume>16</volume>
<numero>1995</numero>
<issue>1995</issue>
<page-range>809-814</page-range></nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kuncheva]]></surname>
<given-names><![CDATA[L.I.]]></given-names>
</name>
<name>
<surname><![CDATA[Bezdek]]></surname>
<given-names><![CDATA[C.J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Nearest prototype classification: clustering, genetic algorithms or random search]]></article-title>
<source><![CDATA[IEEE Transactions on Systems, Man and Cybernetics]]></source>
<year>1998</year>
<volume>28</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>160-164</page-range></nlm-citation>
</ref>
<ref id="B23">
<label>23</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gagne]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Parizeau]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Coevolution of nearest neighbor classifiers]]></article-title>
<source><![CDATA[International Journal of Pattern Recognition and Artificial Intelligence]]></source>
<year>2007</year>
<volume>21</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>921 -946</page-range></nlm-citation>
</ref>
<ref id="B24">
<label>24</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Siedlecki]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Skalansky]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A note on genetic algorithms for large-scale feature selection]]></article-title>
<source><![CDATA[Pattern Recognition Letters]]></source>
<year>1989</year>
<volume>10</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>335-347</page-range></nlm-citation>
</ref>
<ref id="B25">
<label>25</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vafaie]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[De Jong]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Genetic algorithms as a tool for feature selection in machine learning. Fourth International Conference on Tools with Artificial Intelligence]]></source>
<year>1992</year>
<page-range>200-203</page-range><publisher-loc><![CDATA[Arlington^eVA VA]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B26">
<label>26</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Honavar]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Feature subset selection using a genetic algorithm]]></article-title>
<source><![CDATA[IEEE Intelligent Systems and their Applications]]></source>
<year>1998</year>
<volume>13</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>44-49</page-range></nlm-citation>
</ref>
<ref id="B27">
<label>27</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Olveira]]></surname>
<given-names><![CDATA[L.S.]]></given-names>
</name>
<name>
<surname><![CDATA[Benahmed]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Sabourin]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Bortolozzi]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Feature subset selection using genetic algorithms for handwritten digit recognition. 14th Brazilian symposium on Computer Graphics and Image Processing]]></source>
<year>2001</year>
<page-range>362-369</page-range><publisher-loc><![CDATA[Florianópolis ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B28">
<label>28</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sahan]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Polat, k., Kodaz]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Gunes]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A new hybrid method based on fuzzy artificial immune system and k-nn algorithm for breast cancer diagnosis]]></article-title>
<source><![CDATA[Computers in Biology and Medicine]]></source>
<year>2007</year>
<volume>37</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>415-423</page-range></nlm-citation>
</ref>
<ref id="B29">
<label>29</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Garain]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Prototype reduction using an artificial immune model]]></article-title>
<source><![CDATA[Pattern analysis & Applications]]></source>
<year>2008</year>
<volume>11</volume>
<numero>3-4</numero>
<issue>3-4</issue>
<page-range>353-363</page-range></nlm-citation>
</ref>
<ref id="B30">
<label>30</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ahmad]]></surname>
<given-names><![CDATA[S.S.S.]]></given-names>
</name>
<name>
<surname><![CDATA[Pedrycz]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<source><![CDATA[Feature and Instance selection via cooperative PSO. 2011 IEEE International Conference on Systems, Man and Cybernetic]]></source>
<year>2011</year>
<page-range>2127-2132</page-range><publisher-loc><![CDATA[Anchorage^eAK AK]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B31">
<label>31</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mohamed]]></surname>
<given-names><![CDATA[S.S.]]></given-names>
</name>
<name>
<surname><![CDATA[Youssef]]></surname>
<given-names><![CDATA[A.M.]]></given-names>
</name>
<name>
<surname><![CDATA[El-Saadany]]></surname>
<given-names><![CDATA[E.F.]]></given-names>
</name>
<name>
<surname><![CDATA[Salama]]></surname>
<given-names><![CDATA[M.M.A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Artificial life feature selection techniques for prostate cancer diagnosis using TRUS images]]></article-title>
<source><![CDATA[Image Analysis and Recognition. Lecture Notes in Computer Science]]></source>
<year>2005</year>
<volume>3656</volume>
<page-range>903-913</page-range></nlm-citation>
</ref>
<ref id="B32">
<label>32</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Polat]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Sahan]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Kodaz]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Günes]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A new classification method for breast cancer diagnosis: feature selection artificial immune recognition system (FS-AIRS)]]></article-title>
<source><![CDATA[Advances in Natural Computation. Lecture Notes in Computer Science]]></source>
<year>2005</year>
<volume>3611</volume>
<page-range>830-838</page-range></nlm-citation>
</ref>
<ref id="B33">
<label>33</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zainal]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Maarof]]></surname>
<given-names><![CDATA[M.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Shamsuddin]]></surname>
<given-names><![CDATA[S.M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Feature selection using Rough-DPSO in anomaly intrusion detection]]></article-title>
<source><![CDATA[Computational Science and Its Applications-ICCSA 2007. Lecture Notes in Computer Science]]></source>
<year>2005</year>
<volume>4705</volume>
<page-range>512-524</page-range></nlm-citation>
</ref>
<ref id="B34">
<label>34</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bello]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Nowé]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Caballero]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Gómez]]></surname>
<given-names><![CDATA[Y.Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Vrancx]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Using Ant colony system meta-heuristic and Rough Set Theory for feature selection. MIC 2005: 6th Metaheuristics International Conference]]></source>
<year>2005</year>
<publisher-loc><![CDATA[Vienna ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B35">
<label>35</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ruiz-Shulcloper]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Abidi]]></surname>
<given-names><![CDATA[M.A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Logical combinatorial pattern recognition: A Review]]></source>
<year>2002</year>
<page-range>133-176</page-range><publisher-loc><![CDATA[Kerala ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B36">
<label>36</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Garner]]></surname>
<given-names><![CDATA[S.R.]]></given-names>
</name>
</person-group>
<source><![CDATA[WEKA: The Waikato Environment for Knowledge Analysis. Proceedings of the New Zealand Computer Science Research Students Conference]]></source>
<year>1995</year>
<page-range>57-64</page-range><publisher-loc><![CDATA[Hamilton Beach ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B37">
<label>37</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Basturk]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Karaboga]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[An Artificial Bee Colony (ABC) algorithm for numeric function optimization. IEEE Swarm Intelligence Symposium 2006]]></source>
<year>2006</year>
<publisher-loc><![CDATA[Indianapolis^eIndiana Indiana]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B38">
<label>38</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Karaboga]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[An idea based on honey bee swarm for numerical optimization]]></source>
<year>2005</year>
<publisher-loc><![CDATA[Kayseri ]]></publisher-loc>
<publisher-name><![CDATA[Erciyes University]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B39">
<label>39</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Karaboga]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Basturk]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A powerful and efficient algorithm for numerical function optimization: Artificial Bee Colony (ABC) algorithm]]></article-title>
<source><![CDATA[Journal of Global Optimization]]></source>
<year>2007</year>
<volume>39</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>459-471</page-range></nlm-citation>
</ref>
<ref id="B40">
<label>40</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[García-Borroto]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Ruiz-Shulcloper]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Selecting Prototypes in Mixed Incomplete Data. Progress in Pattern Recognition, Image Analysis and Applications]]></article-title>
<source><![CDATA[Lecture Notes in Computer Science]]></source>
<year>2005</year>
<volume>3773</volume>
<page-range>450-459</page-range></nlm-citation>
</ref>
<ref id="B41">
<label>41</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Skalak]]></surname>
<given-names><![CDATA[D.B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms. Eleventh International Conference on Machine Learning]]></source>
<year>1994</year>
<page-range>293-301</page-range><publisher-loc><![CDATA[New Brunswick^eNJ NJ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B42">
<label>42</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ishibushi]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Nakashima]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Evolution of reference sets in nearest neighbor classification]]></article-title>
<source><![CDATA[Simulated Evolution and Learning. Lecture Notes on Computer Science]]></source>
<year>1999</year>
<volume>1585</volume>
<page-range>82-89</page-range></nlm-citation>
</ref>
<ref id="B43">
<label>43</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ahn]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[K.J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Global optimization of case-based reasoning for breast cytology diagnosis]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2009</year>
<volume>36</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>724-734</page-range></nlm-citation>
</ref>
<ref id="B44">
<label>44</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ahn]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[K.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Han]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A case-based reasoning system with the two-dimensional reduction technique for customer classification]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2007</year>
<volume>32</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>1011 - 1019</page-range></nlm-citation>
</ref>
<ref id="B45">
<label>45</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rozsypal]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Kubat]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Selecting representative examples and attributes by a genetic algorithm]]></article-title>
<source><![CDATA[Intelligent Data Analysis]]></source>
<year>2003</year>
<volume>7</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>291 -304</page-range></nlm-citation>
</ref>
<ref id="B46">
<label>46</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ros]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Guillaume]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Pintore]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Chrétien]]></surname>
<given-names><![CDATA[J.R.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Hybrid genetic algorithm for dual selection]]></article-title>
<source><![CDATA[Pattern Analysis and Applications]]></source>
<year>2008</year>
<volume>11</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>179-198</page-range></nlm-citation>
</ref>
<ref id="B47">
<label>47</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Derrac]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Verbiest]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[García]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Cornelis]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Herrera]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[On the use of evolutionary feature selection for improving fuzzy rough set based prototype selection]]></article-title>
<source><![CDATA[Soft Computing]]></source>
<year>2013</year>
<volume>17</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>223-238</page-range></nlm-citation>
</ref>
<ref id="B48">
<label>48</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dasarathy]]></surname>
<given-names><![CDATA[B.V.]]></given-names>
</name>
<name>
<surname><![CDATA[Sánchez]]></surname>
<given-names><![CDATA[J.S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Concurrent Feature and Prototype Selection in the Nearest Neighbor based Decision Process. 4th World Multiconference on Systems, Cybernetics and Informatics]]></source>
<year>2000</year>
<page-range>628-633</page-range><publisher-loc><![CDATA[Orlando ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B49">
<label>49</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kittler]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Feature set search algorithms]]></source>
<year>1978</year>
<page-range>41 -60</page-range><publisher-name><![CDATA[Sijthoff and Noordhoff]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B50">
<label>50</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Toussaint]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Proximity Graphs for Nearest Neighbor Decision Rules: Recent Progress. 34th Symposium on the INTERFACE]]></source>
<year>2002</year>
<page-range>17-20</page-range></nlm-citation>
</ref>
<ref id="B51">
<label>51</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dasarathy]]></surname>
<given-names><![CDATA[B.V.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Minimal consistent set (MCS) identification for optimal nearest neighbor decision systems design]]></article-title>
<source><![CDATA[IEEE Transactions on Systems, Man and Cybernetics]]></source>
<year>1994</year>
<volume>24</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>511 -517</page-range></nlm-citation>
</ref>
<ref id="B52">
<label>52</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Villuendas-Rey]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[García-Borroto]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Medina-Pérez]]></surname>
<given-names><![CDATA[M.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Ruiz-Shulcloper]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Simultaneous features and objects selection for Mixed and Incomplete data. Progress in Pattern Recognition, Image Analysis and Applications]]></article-title>
<source><![CDATA[Lecture Notes on Computer Science]]></source>
<year>2006</year>
<volume>4225</volume>
<page-range>597-605</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
