<?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-55462023000100089</article-id>
<article-id pub-id-type="doi">10.13053/cys-27-1-4224</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Progressive Forest: An Early Stopping Criteria for Building Ensembles]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Cepero-Pérez]]></surname>
<given-names><![CDATA[Nayma]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Moreno-Espino]]></surname>
<given-names><![CDATA[Mailyn]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[García-Borroto]]></surname>
<given-names><![CDATA[Milton]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Morales]]></surname>
<given-names><![CDATA[Eduardo F.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Tecnológica de La Habana &#8220;José Antonio Echeverría&#8221; Facultad de Informática ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Cuba</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Instituto Nacional de Astrofísica, Óptica y Electrónica  ]]></institution>
<addr-line><![CDATA[Puebla ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2023</year>
</pub-date>
<volume>27</volume>
<numero>1</numero>
<fpage>89</fpage>
<lpage>97</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462023000100089&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-55462023000100089&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-55462023000100089&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: Decision forests improve their predictive power based on the combination of various decision trees. The number of trees to be used to achieve the best possible accuracy is not preset and has to be determined by a trial and error process. In many classification problems more trees are used than necessary. This paper introduces a new method, called Progressive Forest, that progressively evaluates the addition of new decision trees into a decision forest to decide when adding more trees is not longer useful. This method was incorporated into the construction schemes of Proactive Forest and Random Forest with very encouraging results. It is experimentally shown that Progressive Forest reduces the number of trees while maintaining the accuracy of the classification. Progressive Forest can be incorporated into any scheme of construction of ensemble, which presents similar characteristics to Random Forest.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Ensemble size]]></kwd>
<kwd lng="en"><![CDATA[accuracy]]></kwd>
<kwd lng="en"><![CDATA[decision forest]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Banfield]]></surname>
<given-names><![CDATA[R. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Hall]]></surname>
<given-names><![CDATA[L. O.]]></given-names>
</name>
<name>
<surname><![CDATA[Bowyer]]></surname>
<given-names><![CDATA[K. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Kegelmeyer]]></surname>
<given-names><![CDATA[W. P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A comparison of decision tree ensemble creation techniques]]></article-title>
<source><![CDATA[IEEE transactions on pattern analysis and machine intelligence]]></source>
<year>2006</year>
<volume>29</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>173-80</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Breiman]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Bagging predictors]]></article-title>
<source><![CDATA[Machine learning]]></source>
<year>1996</year>
<volume>24</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>123-40</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Breiman]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Random forests]]></article-title>
<source><![CDATA[Machine learning]]></source>
<year>2001</year>
<volume>45</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>5-32</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cepero-Pérez]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Denis-Miranda]]></surname>
<given-names><![CDATA[L. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Hernández-Palacio]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Moreno-Espino]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[García-Borroto]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Proactive forest for supervised classification]]></source>
<year>2018</year>
<conf-name><![CDATA[ International Workshop on Artificial Intelligence and Pattern Recognition]]></conf-name>
<conf-loc> </conf-loc>
<page-range>255-62</page-range></nlm-citation>
</ref>
<ref id="B5">
<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[García]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Molina]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Herrera]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms]]></article-title>
<source><![CDATA[Swarn and Evolutionary Computation]]></source>
<year>2011</year>
<volume>1</volume>
<page-range>3-18</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dheeru]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Karra-Taniskidou]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[UCI machine learning repository]]></source>
<year>2017</year>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dietterich]]></surname>
<given-names><![CDATA[T. G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization]]></article-title>
<source><![CDATA[Machine learning]]></source>
<year>2000</year>
<volume>40</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>139-57</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Estrada]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Morales]]></surname>
<given-names><![CDATA[E. F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Nsc: A new progressive sampling algorithm]]></source>
<year>2004</year>
<conf-name><![CDATA[ workshop on Machine Learning for Scienific data Analysis IBERAMIA]]></conf-name>
<conf-date>2004</conf-date>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fan]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Random forest algorithm based on speech for early identification of Parkinson&#8217;s disease]]></article-title>
<source><![CDATA[Computational Intelligence and Neuroscience]]></source>
<year>2022</year>
<volume>2022</volume>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hernández-Lobato]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Martínez-Muñoz]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Suárez]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[How large should ensembles of classifiers be]]></article-title>
<source><![CDATA[Pattern Recognition]]></source>
<year>2013</year>
<volume>46</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>1323-36</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lior]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Ensemble Learning: Pattern Classification Using Ensemble Methods]]></source>
<year>2019</year>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lopes]]></surname>
<given-names><![CDATA[M. E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Estimating a sharp convergence bound for randomized ensembles]]></article-title>
<source><![CDATA[Journal of Statistical Planning and Inference]]></source>
<year>2019</year>
<volume>204</volume>
<page-range>35-44</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pereira]]></surname>
<given-names><![CDATA[D. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Afonso]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Medeiros]]></surname>
<given-names><![CDATA[F. M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Overview of Friedmans test and post-hoc analysis]]></article-title>
<source><![CDATA[Communications in Statistics-Simulation and Computation]]></source>
<year>2015</year>
<volume>44</volume>
<page-range>2636-53</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Provost]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Jensen]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Oates]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<source><![CDATA[Efficient progressive sampling]]></source>
<year>1999</year>
<conf-name><![CDATA[ fifth ACM SIGKDD international conference on Knowledge discovery and data mining]]></conf-name>
<conf-loc> </conf-loc>
<page-range>23-32</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Roka Lior]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Decision forest: Twenty years of research]]></article-title>
<source><![CDATA[Information Fusion]]></source>
<year>2016</year>
<volume>27</volume>
<page-range>111-25</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sagi]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Rokach]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Ensemble learning: A survey]]></article-title>
<source><![CDATA[Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery]]></source>
<year>2018</year>
<volume>8</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>1249</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Explainable ensemble learning model for predicting steel section-concrete bond strength]]></article-title>
<source><![CDATA[Construction and Building Materials]]></source>
<year>2022</year>
<volume>356</volume>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
