<?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-55462006000200003</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[A Supervised Discretization Method for Quantitative and Qualitative Ordered Variables]]></article-title>
<article-title xml:lang="es"><![CDATA[Un método de Discretización Supervisada para Variables Cuantitativas y Cualitativas Ordenadas]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ruiz]]></surname>
<given-names><![CDATA[Francisco J]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Angulo]]></surname>
<given-names><![CDATA[Cecilio]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Agell]]></surname>
<given-names><![CDATA[Núria]]></given-names>
</name>
<xref ref-type="aff" rid="A02"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,Universitat Politècnica de Catalunya Knowledge Engineering Research Group ]]></institution>
<addr-line><![CDATA[Vilanova i la Geltrú Spain]]></addr-line>
</aff>
<aff id="A02">
<institution><![CDATA[,ESADE-Universitat Ramon Llull Department of Quantitative Methods Management ]]></institution>
<addr-line><![CDATA[Barcelona Spain]]></addr-line>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2006</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2006</year>
</pub-date>
<volume>9</volume>
<numero>4</numero>
<fpage>314</fpage>
<lpage>325</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462006000200003&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-55462006000200003&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-55462006000200003&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[In this work, a new technique to define cut-points in the discretization process of a continuous attribute is presented. This method is used as a prior step in a regression problem, considered as a learning problem in which the output variable can be either quantitative (continuous or discreet) or qualitative defined over an ordinal scale. The proposed method emphasizes the concept of location to determine discretization cut-points. In the case of continuous outputs, the method is based on the maximization of the difference between distributions by using intervalar distances. In the case of qualitative outputs, a qualitative distance is defined over a structure of absolute orders of magnitude. The main characteristics of the method presented are illustrated through three examples, two for continuous outputs and the last for a qualitative output.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[En este trabajo se presenta una nueva técnica para definir las fronteras en el proceso de discretización de una variable continua. Este método es usado como paso previo en un problema de regresión, considerado como un problema de aprendizaje en el cual la variable de salida puede ser cuantitativa (continua o discreta) o cualitativa definida sobre una escala ordinal. El método propuesto enfatiza el concepto de "localidad" para determinar las fronteras de las discretización. En el caso de variables continuas, el método se basa en la maximización de la diferencia entre distribuciones usando distancias intercalares, y en el caso de salidas cualitativas, en una distancia definida sobre una estructura de órdenes de magnitud absolutos. La principal característica del método se ilustra con tres ejemplos, dos para salidas continuas y un último con salidas cualitativas.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Supervised Discretization]]></kwd>
<kwd lng="en"><![CDATA[Regression]]></kwd>
<kwd lng="en"><![CDATA[Qualitative Reasoning]]></kwd>
<kwd lng="en"><![CDATA[Intervalar distance]]></kwd>
<kwd lng="es"><![CDATA[Discretización Supervisada]]></kwd>
<kwd lng="es"><![CDATA[Regresión]]></kwd>
<kwd lng="es"><![CDATA[Razonamiento Cualitativo]]></kwd>
<kwd lng="es"><![CDATA[Distancia Intervalar]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[ <p align="justify"><font face="verdana" size="4">Art&iacute;culos</font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="center"><font face="verdana" size="4"><b>A Supervised Discretization Method for Quantitative and Qualitative Ordered Variables</b></font></p>     <p align="center"><font face="verdana" size="2">&nbsp;</font></p>     <p align="center"><font face="verdana" size="4"><i>Un m&eacute;todo de Discretizaci&oacute;n Supervisada para Variables Cuantitativas y Cualitativas Ordenadas</i></font></p>     <p align="center"><font face="verdana" size="2">&nbsp;</font></p>     <p align="center"><font face="verdana" size="2"><b>Francisco J. Ruiz<sup>1</sup>, Cecilio Angulo<sup>1</sup> and N&uacute;ria Agell<sup>2</sup></b></font></p>     <p align="center"><font face="verdana" size="2"><i>1 Knowledge Engineering Research Group. Universitat Polit&egrave;cnica de Catalunya    <br> Av. V&iacute;ctor Balaguer s/n. 08800 Vilanova i la Geltr&uacute; (Spain)</i>    <br> <a href="mailto:francisco.javier.ruiz@upc.edu">francisco.javier.ruiz@upc.edu</a>, <a href="mailto:cecilio.angulo@upc.edu">cecilio.angulo@upc.edu</a></font></p>     ]]></body>
<body><![CDATA[<p align="center"><font face="verdana" size="2"><i>2 Department of Quantitative Methods Management. ESADE&#150;Universitat Ramon Llull    <br> Av. Pedralbes 62&#150;65. 08034 Barcelona (Spain)</i>    <br> <a href="mailto:nuria.agell@esade.edu">nuria.agell@esade.edu</a></font></p>     <p align="center"><font face="verdana" size="2">&nbsp;</font></p>     <p align="center"><font face="verdana" size="2"><u>Article received on November 15, 2005; accepted on January 01,2006</u></font></p>     <p align="center"><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">In this work, a new technique to define cut&#150;points in the discretization process of a continuous attribute is presented. This method is used as a prior step in a regression problem, considered as a learning problem in which the output variable can be either quantitative (continuous or discreet) or qualitative defined over an ordinal scale. The proposed method emphasizes the concept of location to determine discretization cut&#150;points. In the case of continuous outputs, the method is based on the maximization of the difference between distributions by using intervalar distances. In the case of qualitative outputs, a qualitative distance is defined over a structure of absolute orders of magnitude. The main characteristics of the method presented are illustrated through three examples, two for continuous outputs and the last for a qualitative output.</font></p>     <p align="justify"><font face="verdana" size="2"><b>Keywords: </b>Supervised Discretization, Regression, Qualitative Reasoning, Intervalar distance.</font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2"><b>Resumen</b></font></p>     <p align="justify"><font face="verdana" size="2">En este trabajo se presenta una nueva t&eacute;cnica para definir las fronteras en el proceso de discretizaci&oacute;n de una variable continua. Este m&eacute;todo es usado como paso previo en un problema de regresi&oacute;n, considerado como un problema de aprendizaje en el cual la variable de salida puede ser cuantitativa (continua o discreta) o cualitativa definida sobre una escala ordinal. El m&eacute;todo propuesto enfatiza el concepto de "localidad" para determinar las fronteras de las discretizaci&oacute;n. En el caso de variables continuas, el m&eacute;todo se basa en la maximizaci&oacute;n de la diferencia entre distribuciones usando distancias intercalares, y en el caso de salidas cualitativas, en una distancia definida sobre una estructura de &oacute;rdenes de magnitud absolutos. La principal caracter&iacute;stica del m&eacute;todo se ilustra con tres ejemplos, dos para salidas continuas y un &uacute;ltimo con salidas cualitativas.</font></p>     <p align="justify"><font face="verdana" size="2"><b>Palabras Clave: </b>Discretizaci&oacute;n Supervisada, Regresi&oacute;n, Razonamiento Cualitativo, Distancia Intervalar.</font></p>     <p align="justify">&nbsp;</p>     <p align="justify"><font face="verdana" size="2"><a href="/pdf/cys/v9n4/v9n4a3.pdf" target="_blank">DESCARGA ARTICULO 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>Acknowledgements</b></font></p>     <p align="justify"><font face="verdana" size="2">This work has been partially supported by the coordinated project MERITO (analysis and development of innovative soft&#150;computing techniques integrating expert knowledge: an application to the measure of financial credit risk), funded by the Spanish Ministry of Science and Technology (TIC2002&#150;04371&#150;C02).</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>     ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">1. N&uacute;ria Agell. <i>Estructures matematiques per al model qualitatiu d'ordres de magnitud absoluts. </i>Ph. D. Thesis. Universitat Polit&egrave;cnica de Catalunya, 1998.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2040495&pid=S1405-5546200600020000300001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">2. N&uacute;ria Agell, F.J. Ruiz, and Cecilio Angulo. A kernel intersection defined on intervals. In <i>Proc del Congr&eacute;s Catal&agrave; d'Intellig&egrave;ncia Artificial, </i>2004.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2040496&pid=S1405-5546200600020000300002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">3. N&uacute;ria Agell, Xari Rovira, Francisco Ruiz, and Cecilio Angulo. Kernel machines for continuous and discrete variables: An application to credit risk measurement. In <i>Proc. of the Learning 04, </i>Elche, Spain, 2004.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2040497&pid=S1405-5546200600020000300003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">4. Catlett J. On changing continuous attributes into ordered discrete attributes. <i>Proc. Fifth European Working Session on Learning. </i>Berlin: Springer Verlag, pp. 164&#150;177, 1991.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2040498&pid=S1405-5546200600020000300004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">5. J.Y. Ching, A.K.C. Wong, and K.C.C. Chan. Class&#150;dependent discretization for inductive learning from continuous and mixed mode data. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence, </i>17(7):641&#150;651, 1995.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2040499&pid=S1405-5546200600020000300005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">6. James Dougherty, Ron Kohavi, and Mehran Sahami. Supervised and unsupervised discretization of continuous features. In <i>International Conference on Machine Learning, </i>pages 194&#150;202, 1995.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2040500&pid=S1405-5546200600020000300006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">7. U. M. Fayyad and K. B. Irani. Multi&#150;interval discretization of continuous&#150;valued attributes for classification learning. <i>In Proc. of the 13th IJCAI, </i>pages 1022&#150;1027, Chambery, France, 1993.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2040501&pid=S1405-5546200600020000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">8. Luis Gonz&aacute;lez, Francisco Velasco, Cecilio Angulo, J.A. Ortega, and F.J. Ruiz. Sobre n&uacute;cleos, distancias y similitudes entre intervalos. <i>Revista Iberoamericana de Inteligencia Artificial, </i>8(23): 111&#150;117, 2004.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2040502&pid=S1405-5546200600020000300008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">9. Ho, K.M and Scott, P.D. Zeta: A global method for discretization of continuous variables. In <i>KDD97: 3rd International Conference of Knowledge Discovery and Data mining. </i>Newport Beach, CA, pp. 191&#150;194, 1997.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2040503&pid=S1405-5546200600020000300009&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">10. Kerber, R.  ChiMerge: Discretization of Numeric Attributes. <i>Proc.  10th National Conference on Artificial Intelligence. </i>MIT Press, pp. 123&#150;128, 1992.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2040504&pid=S1405-5546200600020000300010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">11. Kurgan, L.A and Cios, K.J CAIM Discretization Algorithm. <i>IEEE Transactions on Knowledge and Data Engineering, </i>vol. 16, no. 2. pp. 145&#150;153, 2004.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2040505&pid=S1405-5546200600020000300011&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">12. H. Liu, F. Hussain, C. Lim Tam, and M. Dash. Discretization: An enabling technique. <i>Data Mining and Knowledge Discovery, </i>6(4):393&#150;423, 2002.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2040506&pid=S1405-5546200600020000300012&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">13. Rovira, X., Agell, N., S&aacute;nchez, M., Prats, F. and Parra, X. An Approach to Qualitative Radial Basis Function Networks over Orders of Magnitude. <i>Proceedings of 18th International Workshop on Qualitative Reasoning. </i>2004.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2040507&pid=S1405-5546200600020000300013&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">14. Trav&eacute;&#150;Massuy&egrave;s, L. and Dague, P. <i>Mod&egrave;les et raisonnements qualitatifs. </i>Herm&egrave;s, 2003.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2040508&pid=S1405-5546200600020000300014&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">15. Wang, K. and Liu, B. Concurrent discretization of multiple attributes. <i>Pacific&#150;Rim International Conference </i>on AI. pp. 250&#150;259, 1998.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2040509&pid=S1405-5546200600020000300015&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">16. Wong, A.K.C. and Liu, T.S. Typicality, diversity and feature pattern of an ensemble, <i>IEEE Trans. Computers, </i>vol. 24, pp. 158&#150;181, 1975.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2040510&pid=S1405-5546200600020000300016&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --> ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Agell]]></surname>
<given-names><![CDATA[Núria]]></given-names>
</name>
</person-group>
<source><![CDATA[Estructures matematiques per al model qualitatiu d'ordres de magnitud absoluts]]></source>
<year>1998</year>
<publisher-name><![CDATA[Universitat Politècnica de Catalunya]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Agell]]></surname>
<given-names><![CDATA[Núria]]></given-names>
</name>
<name>
<surname><![CDATA[Ruiz]]></surname>
<given-names><![CDATA[F.J]]></given-names>
</name>
<name>
<surname><![CDATA[Angulo]]></surname>
<given-names><![CDATA[Cecilio]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A kernel intersection defined on intervals]]></article-title>
<source><![CDATA[]]></source>
<year></year>
<conf-name><![CDATA[ d'Intelligència Artificial]]></conf-name>
<conf-date>2004</conf-date>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Agell]]></surname>
<given-names><![CDATA[Núria]]></given-names>
</name>
<name>
<surname><![CDATA[Rovira]]></surname>
<given-names><![CDATA[Xari]]></given-names>
</name>
<name>
<surname><![CDATA[Ruiz]]></surname>
<given-names><![CDATA[Francisco]]></given-names>
</name>
<name>
<surname><![CDATA[Angulo]]></surname>
<given-names><![CDATA[Cecilio]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Kernel machines for continuous and discrete variables: An application to credit risk measurement]]></article-title>
<source><![CDATA[Proc. of the Learning 04]]></source>
<year>2004</year>
<publisher-loc><![CDATA[Elche ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Catlett]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<source><![CDATA[On changing continuous attributes into ordered discrete attributes: Proc. Fifth European Working Session on Learning]]></source>
<year>1991</year>
<page-range>164-177</page-range><publisher-loc><![CDATA[Berlin ]]></publisher-loc>
<publisher-name><![CDATA[Springer Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ching]]></surname>
<given-names><![CDATA[J.Y]]></given-names>
</name>
<name>
<surname><![CDATA[Wong]]></surname>
<given-names><![CDATA[A.K.C]]></given-names>
</name>
<name>
<surname><![CDATA[Chan]]></surname>
<given-names><![CDATA[K.C.C]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Class-dependent discretization for inductive learning from continuous and mixed mode data]]></article-title>
<source><![CDATA[IEEE Transactions on Pattern Analysis and Machine Intelligence]]></source>
<year>1995</year>
<volume>17</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>641-651</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dougherty]]></surname>
<given-names><![CDATA[James]]></given-names>
</name>
<name>
<surname><![CDATA[Kohavi]]></surname>
<given-names><![CDATA[Ron]]></given-names>
</name>
<name>
<surname><![CDATA[Sahami]]></surname>
<given-names><![CDATA[Mehran]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Supervised and unsupervised discretization of continuous features]]></article-title>
<source><![CDATA[]]></source>
<year>1995</year>
<conf-name><![CDATA[ International Conference on Machine Learning]]></conf-name>
<conf-loc> </conf-loc>
<page-range>194-202</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[Fayyad]]></surname>
<given-names><![CDATA[U. M]]></given-names>
</name>
<name>
<surname><![CDATA[Irani]]></surname>
<given-names><![CDATA[K. B]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Multi-interval discretization of continuous-valued attributes for classification learning]]></article-title>
<source><![CDATA[]]></source>
<year>1993</year>
<conf-name><![CDATA[ Proc. of the 13th IJCAI]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1022-1027</page-range><publisher-loc><![CDATA[Chambery ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[González]]></surname>
<given-names><![CDATA[Luis]]></given-names>
</name>
<name>
<surname><![CDATA[Velasco]]></surname>
<given-names><![CDATA[Francisco]]></given-names>
</name>
<name>
<surname><![CDATA[Angulo]]></surname>
<given-names><![CDATA[Cecilio]]></given-names>
</name>
<name>
<surname><![CDATA[Ortega]]></surname>
<given-names><![CDATA[J.A]]></given-names>
</name>
<name>
<surname><![CDATA[Ruiz]]></surname>
<given-names><![CDATA[F.J]]></given-names>
</name>
</person-group>
<article-title xml:lang="es"><![CDATA[Sobre núcleos, distancias y similitudes entre intervalos]]></article-title>
<source><![CDATA[Revista Iberoamericana de Inteligencia Artificial]]></source>
<year>2004</year>
<volume>8</volume>
<numero>23</numero>
<issue>23</issue>
<page-range>111-117</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ho]]></surname>
<given-names><![CDATA[K.M]]></given-names>
</name>
<name>
<surname><![CDATA[Scott]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Zeta]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A global method for discretization of continuous variables]]></article-title>
<source><![CDATA[KDD97]]></source>
<year>1997</year>
<conf-name><![CDATA[ 3rd International Conference of Knowledge Discovery and Data mining]]></conf-name>
<conf-loc> </conf-loc>
<page-range>191-194</page-range><publisher-loc><![CDATA[Newport Beach^eCA CA]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kerber]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<source><![CDATA[ChiMerge: Discretization of Numeric Attributes]]></source>
<year>1992</year>
<conf-name><![CDATA[ Proc. 10th National Conference on Artificial Intelligence]]></conf-name>
<conf-loc> </conf-loc>
<page-range>123-128</page-range><publisher-name><![CDATA[MIT Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kurgan]]></surname>
<given-names><![CDATA[L.A]]></given-names>
</name>
<name>
<surname><![CDATA[Cios]]></surname>
<given-names><![CDATA[K.J]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[CAIM Discretization Algorithm]]></article-title>
<source><![CDATA[IEEE Transactions on Knowledge and Data Engineering]]></source>
<year>2004</year>
<volume>16</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>145-153</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Hussain]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
<name>
<surname><![CDATA[Lim Tam]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Dash]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Discretization: An enabling technique]]></article-title>
<source><![CDATA[Data Mining and Knowledge Discovery]]></source>
<year>2002</year>
<volume>6</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>393-423</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rovira]]></surname>
<given-names><![CDATA[X]]></given-names>
</name>
<name>
<surname><![CDATA[Agell]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
<name>
<surname><![CDATA[Sánchez]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Prats]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
<name>
<surname><![CDATA[Parra]]></surname>
<given-names><![CDATA[X]]></given-names>
</name>
</person-group>
<source><![CDATA[An Approach to Qualitative Radial Basis Function Networks over Orders of Magnitude]]></source>
<year></year>
<conf-name><![CDATA[ Proceedings of 18th International Workshop on Qualitative Reasoning]]></conf-name>
<conf-date>2004</conf-date>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Travé-Massuyès]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Dague]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
</person-group>
<source><![CDATA[Modèles et raisonnements qualitatifs]]></source>
<year>2003</year>
<publisher-name><![CDATA[Hermès]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
</person-group>
<source><![CDATA[Concurrent discretization of multiple attributes]]></source>
<year>1998</year>
<conf-name><![CDATA[ Pacific-Rim International Conference on AI]]></conf-name>
<conf-loc> </conf-loc>
<page-range>250-259</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[Wong]]></surname>
<given-names><![CDATA[A.K.C]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[T.S]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Typicality, diversity and feature pattern of an ensemble]]></article-title>
<source><![CDATA[IEEE Trans. Computers]]></source>
<year>1975</year>
<volume>24</volume>
<page-range>158-181</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
