<?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-55462013000100010</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Decision Tree based Classifiers for Large Datasets]]></article-title>
<article-title xml:lang="es"><![CDATA[Clasificadores basados en árboles de decisión para grandes conjuntos de datos]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Franco-Arcega]]></surname>
<given-names><![CDATA[Anilu]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Carrasco-Ochoa]]></surname>
<given-names><![CDATA[Jesús Ariel]]></given-names>
</name>
<xref ref-type="aff" rid="A02"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Sánchez-Díaz]]></surname>
<given-names><![CDATA[Guillermo]]></given-names>
</name>
<xref ref-type="aff" rid="A03"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Martínez-Trinidad]]></surname>
<given-names><![CDATA[José Francisco]]></given-names>
</name>
<xref ref-type="aff" rid="A02"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,Universidad Autónoma del Estado de Hidalgo  ]]></institution>
<addr-line><![CDATA[ Hidalgo]]></addr-line>
<country>México</country>
</aff>
<aff id="A02">
<institution><![CDATA[,Instituto Nacional de Astrofísica, Óptica y Electrónica  ]]></institution>
<addr-line><![CDATA[ Puebla]]></addr-line>
<country>México</country>
</aff>
<aff id="A03">
<institution><![CDATA[,Universidad Autónoma de San Luis Potosí  ]]></institution>
<addr-line><![CDATA[ San Luis Potosí]]></addr-line>
<country>México</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2013</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2013</year>
</pub-date>
<volume>17</volume>
<numero>1</numero>
<fpage>95</fpage>
<lpage>102</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462013000100010&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-55462013000100010&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-55462013000100010&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[In this paper, several algorithms have been developed for building decision trees from large datasets. These algorithms overcome some restrictions of the most recent algorithms in the state of the art. Three of these algorithms have been designed to process datasets described exclusively by numeric attributes, and the fourth one, for processing mixed datasets. The proposed algorithms process all the training instances without storing the whole dataset in the main memory. Besides, the developed algorithms are faster than the most recent algorithms for building decision trees from large datasets, and reach competitive accuracy rates.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[En este artículo se desarrollaron varios algoritmos de generación de árboles de decisión a partir de grandes conjuntos de datos, los cuales resuelven algunas de las limitaciones de los algoritmos más recientes del estado del arte. Tres de estos algoritmos permiten procesar conjuntos de datos descritos exclusivamente por atributos numéricos; y otro puede procesar conjuntos de datos mezclados. Los algoritmos propuestos procesan todos los objetos del conjunto de entrenamiento sin necesidad de almacenarlo completo en memoria. Además, los algoritmos desarrollados son más rápidos que los algoritmos más recientes para la generación de árboles de decisión para grandes conjuntos de datos, obteniendo resultados de clasificación competitivos.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Decision trees]]></kwd>
<kwd lng="en"><![CDATA[supervised classification]]></kwd>
<kwd lng="en"><![CDATA[large datasets]]></kwd>
<kwd lng="es"><![CDATA[Árboles de decisión]]></kwd>
<kwd lng="es"><![CDATA[clasificación supervisada]]></kwd>
<kwd lng="es"><![CDATA[grandes conjuntos de datos]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[  	    <p align="justify"><font face="verdana" size="4">Resumen de tesis doctoral</font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="center"><font face="verdana" size="4"><b>Decision Tree based Classifiers for Large Datasets</b></font></p>  	    <p align="center"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="center"><font face="verdana" size="3"><b>Clasificadores basados en &aacute;rboles de decisi&oacute;n para grandes conjuntos de datos</b></font></p>  	    <p align="center"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="center"><font face="verdana" size="2"><b>Anilu Franco&#45;Arcega<sup><a name="n1b"></a><a href="#n1a">1</a>,2</sup>, Jes&uacute;s Ariel Carrasco&#45;Ochoa<sup>2</sup>, Guillermo S&aacute;nchez&#45;D&iacute;az<sup>3</sup>, and Jos&eacute; Francisco Mart&iacute;nez&#45;Trinidad<sup>2</sup></b></font></p>  	    <p align="center"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><sup><i>1</i></sup> <i>Universidad Aut&oacute;noma del Estado de Hidalgo, Hidalgo, M&eacute;xico.</i></font></p>  	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2"><sup><i>2</i></sup> <i>Instituto Nacional de Astrof&iacute;sica, &Oacute;ptica y Electr&oacute;nica, Puebla, M&eacute;xico.</i></font></p>  	    <p align="justify"><font face="verdana" size="2"><sup><i>3</i></sup> <i>Universidad Aut&oacute;noma de San Luis Potos&iacute;, San Luis Potos&iacute;, M&eacute;xico.</i> <a href="mailto:afranco@uaeh.edu.mx">afranco@uaeh.edu.mx,</a> <a href="mailto:anifranco6@inaoep.mx">anifranco6@inaoep.mx</a>, <a href="mailto:ariel@inaoep.mx">ariel@inaoep.mx</a>, <a href="mailto:fmartine@inaoep.mx">fmartine@inaoep.mx</a>, <a href="mailto:guillermo.sanchez@uaslp.mx">guillermo.sanchez@uaslp.mx</a></font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2">Article received on 21/09/2011.    <br> 	Accepted on 25/09/2011.</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">In this paper, several algorithms have been developed for building decision trees from large datasets. These algorithms overcome some restrictions of the most recent algorithms in the state of the art. Three of these algorithms have been designed to process datasets described exclusively by numeric attributes, and the fourth one, for processing mixed datasets. The proposed algorithms process all the training instances without storing the whole dataset in the main memory. Besides, the developed algorithms are faster than the most recent algorithms for building decision trees from large datasets, and reach competitive accuracy rates.</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Keywords:</b> Decision trees, supervised classification, large datasets.</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 art&iacute;culo se desarrollaron varios algoritmos de generaci&oacute;n de &aacute;rboles de decisi&oacute;n a partir de grandes conjuntos de datos, los cuales resuelven algunas de las limitaciones de los algoritmos m&aacute;s recientes del estado del arte. Tres de estos algoritmos permiten procesar conjuntos de datos descritos exclusivamente por atributos num&eacute;ricos; y otro puede procesar conjuntos de datos mezclados. Los algoritmos propuestos procesan todos los objetos del conjunto de entrenamiento sin necesidad de almacenarlo completo en memoria. Adem&aacute;s, los algoritmos desarrollados son m&aacute;s r&aacute;pidos que los algoritmos m&aacute;s recientes para la generaci&oacute;n de &aacute;rboles de decisi&oacute;n para grandes conjuntos de datos, obteniendo resultados de clasificaci&oacute;n competitivos.</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Palabras clave:</b> &Aacute;rboles de decisi&oacute;n, clasificaci&oacute;n supervisada, grandes conjuntos de datos.</font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><a href="/pdf/cys/v17n1/v17n1a10.pdf">DESCARGAR ART&Iacute;CULO EN FORMATO PDF</a></font></p> 	    <p align="justify">&nbsp;</p> 	    <p align="justify"><font face="verdana" size="2"><b>Acknowledgements</b></font></p> 	    <p align="justify"><font face="verdana" size="2">Authors wish to thank CONACyT for its support with the grant 165151 given to the first author of this paper, and the project grants CB2008&#45;106443 and CB2008&#45;106366.</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"><b>1. Alsabti, K., Ranka, S., &amp; Singh, V. (1998).</b> CLOUDS: A decision tree classifier for large datasets. <i>Fourth International Conference on Knowledge Discovery and Data Mining (KDD&#45;98),</i> New York, USA, 2&#45;8.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2058733&pid=S1405-5546201300010001000001&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. Breiman, L., Friedman, J.H., Olshen, R.A., &amp; Stone, C.J. (1984).</b> <i>Classification and Regression Trees.</i> Belmont, Calif.: Wadsworth International Group.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2058735&pid=S1405-5546201300010001000002&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. Chakrabarti, S., Cox, E., Frank, E., Guting, R.H., Han, J., Jiang, X., Kamber, M., Lightstone, S.S., Nadeau, T.P., Neapolitan, R.E., Pyle, D., Refaat, M., Schneider, M., Teorey, T.J., &amp; Witten, I.H. (2009).</b> <i>Data Mining: Know it all.</i> Burlington, MA: Elsevier/ Morgan Kaufmann Publishers.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2058737&pid=S1405-5546201300010001000003&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. Domingos, P. &amp; Hulten, G. (2000).</b> Mining highspeed data streams. <i>Sixth ACM SIGKDD international Conference on Knowledge Discovery and Data Mining (KDD'00),</i> Boston, MA, USA, 71-80.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2058739&pid=S1405-5546201300010001000004&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. Gama, J. &amp; Medas, P. (2005).</b> Learning decision trees from dynamic data streams. <i>Journal of Universal Computer Science,</i> 11 (8), 1353&#45;1366.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2058741&pid=S1405-5546201300010001000005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2"><b>6. Gehrke, J., Ganti, V., Ramakrishnan, R., &amp; Loh, W.Y. (1999).</b> BOAT &#45; Optimistic decision tree construction. <i>ACM SIGMOD Record,</i> 28(2), 169180.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2058743&pid=S1405-5546201300010001000006&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. Gehrke, J., Ramakrishnan, R., &amp; Ganti, V. (2000).</b> Rainforest &#45; A framework for fast decision tree construction of large datasets. <i>Data Mining and Knowledge Discovery,</i> 4(2&#45;3), 127&#45;162.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2058745&pid=S1405-5546201300010001000007&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. Janikow, C.Z. (1998).</b> Fuzzy decision trees: Issues and methods. <i>IEEE Transactions on Systems, Man and Cybernetics &#45; Part B: Cybernetics,</i> 28(1), 1&#45;14.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2058747&pid=S1405-5546201300010001000008&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. Mehta, M., Agrawal, R., &amp; Rissanen, J. (1996).</b> SLIQ: A fast scalable classifier for data mining. <i>Fifth International Conference Extending Database Technology (EDBT),</i> Avignon, France, 18&#45;32.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2058749&pid=S1405-5546201300010001000009&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. Mitchell, T.M. (1997).</b> <i>Machine Learning.</i> New York: McGraw Hill.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2058751&pid=S1405-5546201300010001000010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2"><b>11. PÃ©rez, J.M., Muguerza, J., Arbelaitz, O., Gurrutxaga, I., &amp; Martin, J.I. (2007).</b> Combining multiple class distribution modified subsamples in a single tree. <i>Pattern Recognition Letters,</i> 28(4), 414&#45;422.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2058753&pid=S1405-5546201300010001000011&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. Quinlan, J.R. (1986).</b> Induction of decision trees. <i>Machine Learning,</i> 1(1), 81 &#45;106.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2058755&pid=S1405-5546201300010001000012&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. Quinlan, J.R. (1993).</b> <i>C4.5: Programs for Machine Learning.</i> San Mateo, Calif.: Morgan Kaufmann Publishers.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2058757&pid=S1405-5546201300010001000013&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. SDSS &#45; Adelman&#45;McCarthy, J., Agueros, M. A., Allam, S.S., et al. (2008).</b> The Sixth Data Release of the Sloan Digital Sky Survey. <i>The Astrophysical Journal Supplement,</i> 175(2), 297&#45;313.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2058759&pid=S1405-5546201300010001000014&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. Shafer, J.C., Agrawal, R., &amp; Mehta, M. (1996).</b> SPRINT: A scalable parallel classifier for data mining. <i>22<sup>nd</sup> International Conference on Very Large Data Bases (VLDB '96),</i> Mumbai, India, 544&#45;555.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2058761&pid=S1405-5546201300010001000015&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2"><b>16. Hsing&#45;Kuo, P., Shou&#45;Chih, C., &amp; Yuh&#45;Jye, L. (2005).</b> Model trees for classification of hybrid data types. <i>6<sup>th</sup> international conference on Intelligent Data Engineering and Automated Learning (IDEAL'05),</i> Queensland, Australia, 32&#45;39.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2058763&pid=S1405-5546201300010001000016&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. Kdd cup</b> 1999 data (1999). Retrieved from <a href="http://kdd.ics.uci.edu/databases/kddcup99/kddcup99.html" target="_blank">http://kdd.ics.uci.edu/databases/kddcup99/kddcup99.html</a></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=2058765&pid=S1405-5546201300010001000017&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"><b>18. Utgoff, P.E. (1989).</b> Incremental induction of decision trees. <i>Machine Learning,</i> 4(2), 161&#45;186.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2058766&pid=S1405-5546201300010001000018&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. Utgoff, P.E., Berkman, N.C., &amp; Clouse, J.A. (1997).</b> Decision tree induction based on efficient tree restructuring. <i>Machine Learning,</i> 29(1), 5&#45;44.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2058768&pid=S1405-5546201300010001000019&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. Yang, B., Wang, T., Yang, D., &amp; Chang, L. (2008).</b> BOAI: Fast alternating decision tree induction based on bottom&#45;up evaluation. <i>12<sup>th</sup> Pacific&#45;Asia Conference on Advances in Knowledge Discovery and Data Mining (PAKDD'08),</i> Osaka, Japan, 405&#45;416.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2058770&pid=S1405-5546201300010001000020&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. Yoon, H., Alsabti, K., &amp; Ranka, S. (1999).</b> <i>Tree&#45;</i><i>based incremental classification for large datasets.</i> Technical Report (TR&#45;99&#45;013), Gainesville, FL.: University of Florida.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2058772&pid=S1405-5546201300010001000021&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Note</b></font></p>  	    <p align="justify"><font face="verdana" size="2"><sup><a name="n1a"></a><a href="#n1b">1</a></sup>Extended abstract of PhD thesis. Graduated: Anilu Franco&#45;Arcega. Advisors Jesus Ariel Carrasco Ochoa, Guillermo Sanchez&#45;Diaz, and Jose Francisco Martinez&#45;Trinidad. Graduation date: 14/07/2010.</font></p>      ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Alsabti]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Ranka]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Singh]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[CLOUDS: A decision tree classifier for large datasets]]></article-title>
<source><![CDATA[Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98)]]></source>
<year>1998</year>
<page-range>2-8</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Breiman]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Friedman]]></surname>
<given-names><![CDATA[J.H.]]></given-names>
</name>
<name>
<surname><![CDATA[Olshen]]></surname>
<given-names><![CDATA[R.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Stone]]></surname>
<given-names><![CDATA[C.J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Classification and Regression Trees]]></source>
<year>1984</year>
<publisher-loc><![CDATA[Belmont^eCalif Calif]]></publisher-loc>
<publisher-name><![CDATA[Wadsworth International Group]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chakrabarti]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Cox]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Frank]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Guting]]></surname>
<given-names><![CDATA[R.H.]]></given-names>
</name>
<name>
<surname><![CDATA[Han]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Jiang]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Kamber]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Lightstone]]></surname>
<given-names><![CDATA[S.S.]]></given-names>
</name>
<name>
<surname><![CDATA[Nadeau]]></surname>
<given-names><![CDATA[T.P.]]></given-names>
</name>
<name>
<surname><![CDATA[Neapolitan]]></surname>
<given-names><![CDATA[R.E.]]></given-names>
</name>
<name>
<surname><![CDATA[Pyle]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Refaat]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Schneider]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Teorey]]></surname>
<given-names><![CDATA[T.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Witten]]></surname>
<given-names><![CDATA[I.H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Data Mining: Know it all]]></source>
<year>2009</year>
<publisher-loc><![CDATA[Burlington^eMA MA]]></publisher-loc>
<publisher-name><![CDATA[ElsevierMorgan Kaufmann Publishers]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Domingos]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Hulten]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Mining highspeed data streams]]></article-title>
<source><![CDATA[Sixth ACM SIGKDD international Conference on Knowledge Discovery and Data Mining (KDD'00)]]></source>
<year>2000</year>
<page-range>71-80</page-range><publisher-loc><![CDATA[Boston^eMA MA]]></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[Gama]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Medas]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Learning decision trees from dynamic data streams]]></article-title>
<source><![CDATA[Journal of Universal Computer Science]]></source>
<year>2005</year>
<volume>11</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>1353-1366</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[Gehrke]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Ganti]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramakrishnan]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Loh]]></surname>
<given-names><![CDATA[W.Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[BOAT - Optimistic decision tree construction]]></article-title>
<source><![CDATA[ACM SIGMOD Record]]></source>
<year>1999</year>
<volume>28</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>169180</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[Gehrke]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramakrishnan]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Ganti]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Rainforest - A framework for fast decision tree construction of large datasets]]></article-title>
<source><![CDATA[Data Mining and Knowledge Discovery]]></source>
<year>2000</year>
<volume>4</volume>
<numero>2-3</numero>
<issue>2-3</issue>
<page-range>127-162</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[Janikow]]></surname>
<given-names><![CDATA[C.Z.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Fuzzy decision trees: Issues and methods]]></article-title>
<source><![CDATA[IEEE Transactions on Systems, Man and Cybernetics - Part B: Cybernetics]]></source>
<year>1998</year>
<volume>28</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-14</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mehta]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Agrawal]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Rissanen]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[SLIQ: A fast scalable classifier for data mining]]></article-title>
<source><![CDATA[Fifth International Conference Extending Database Technology (EDBT)]]></source>
<year>1996</year>
<page-range>18-32</page-range><publisher-loc><![CDATA[Avignon ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mitchell]]></surname>
<given-names><![CDATA[T.M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Machine Learning]]></source>
<year>1997</year>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[McGraw Hill]]></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[Pérez]]></surname>
<given-names><![CDATA[J.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Muguerza]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Arbelaitz]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Gurrutxaga]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Martin]]></surname>
<given-names><![CDATA[J.I.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Combining multiple class distribution modified subsamples in a single tree]]></article-title>
<source><![CDATA[Pattern Recognition Letters]]></source>
<year>2007</year>
<volume>28</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>414-422</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[Quinlan]]></surname>
<given-names><![CDATA[J.R.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Induction of decision trees]]></article-title>
<source><![CDATA[Machine Learning]]></source>
<year>1986</year>
<volume>1</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>81 -106</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Quinlan]]></surname>
<given-names><![CDATA[J.R.]]></given-names>
</name>
</person-group>
<source><![CDATA[C4.5: Programs for Machine Learning]]></source>
<year>1993</year>
<publisher-loc><![CDATA[San Mateo^eCalif Calif]]></publisher-loc>
<publisher-name><![CDATA[Morgan Kaufmann Publishers]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Adelman-McCarthy]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Agueros]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Allam]]></surname>
<given-names><![CDATA[S.S.]]></given-names>
</name>
</person-group>
<collab>SDSS</collab>
<article-title xml:lang="en"><![CDATA[The Sixth Data Release of the Sloan Digital Sky Survey]]></article-title>
<source><![CDATA[The Astrophysical Journal Supplement]]></source>
<year>2008</year>
<volume>175</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>297-313</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shafer]]></surname>
<given-names><![CDATA[J.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Agrawal]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Mehta]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[SPRINT: A scalable parallel classifier for data mining]]></article-title>
<source><![CDATA[22nd International Conference on Very Large Data Bases (VLDB '96)]]></source>
<year>1996</year>
<page-range>544-555</page-range><publisher-loc><![CDATA[Mumbai ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hsing-Kuo]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Shou-Chih]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Yuh-Jye]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Model trees for classification of hybrid data types]]></article-title>
<source><![CDATA[6th international conference on Intelligent Data Engineering and Automated Learning (IDEAL'05)]]></source>
<year>2005</year>
<page-range>32-39</page-range><publisher-loc><![CDATA[Queensland ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="">
<collab>Kdd cup</collab>
<source><![CDATA[]]></source>
<year>1999</year>
</nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Utgoff]]></surname>
<given-names><![CDATA[P.E.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Incremental induction of decision trees]]></article-title>
<source><![CDATA[Machine Learning]]></source>
<year>1989</year>
<volume>4</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>161-186</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[Utgoff]]></surname>
<given-names><![CDATA[P.E.]]></given-names>
</name>
<name>
<surname><![CDATA[Berkman]]></surname>
<given-names><![CDATA[N.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Clouse]]></surname>
<given-names><![CDATA[J.A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Decision tree induction based on efficient tree restructuring]]></article-title>
<source><![CDATA[Machine Learning]]></source>
<year>1997</year>
<volume>29</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>5-44</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Chang]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[BOAI: Fast alternating decision tree induction based on bottom-up evaluation]]></article-title>
<source><![CDATA[12th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining (PAKDD'08)]]></source>
<year>2008</year>
<page-range>405-416</page-range><publisher-loc><![CDATA[Osaka ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yoon]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Alsabti]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Ranka]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Tree-based incremental classification for large datasets]]></source>
<year>1999</year>
<publisher-loc><![CDATA[Gainesville^eFL FL]]></publisher-loc>
<publisher-name><![CDATA[University of Florida]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
