Bosques aleatorios como extensión de los árboles de clasificación con los programas R y Python

• Autores: Medina Merino, Rosa Fátima, Ñique Chacón, Carmen Ismelda
• Formato: artículo
• Fecha de Publicación: 2017
• Institución: Universidad de Lima
• Repositorio: ULIMA-Institucional
• Lenguaje: español
• OAI Identifier: oai:repositorio.ulima.edu.pe:20.500.12724/5560
• Enlace del recurso: https://hdl.handle.net/20.500.12724/5560
• Nivel de acceso: acceso abierto
• Materia: Árboles (Teoría de grafos); Python (Lenguaje de programación); Algoritmos de computadoras; Trees (Graph theory); Python (computer program language); Computer algorithms

This article presents the application of the non-parametric Random Forest method through supervised learning, as an extension of classification trees. The Random Forest algorithm arises as the grouping of several classification trees. Basically it randomly selects a number of variables with which each individual tree is constructed and predictions are made with these variables that will later be weighted through the calculation of the most voted class of these trees that were generated, to finally do the prediction by Random Forest. For the application, we worked with 3168 recorded voices, for which the results of an acoustic analysis are presented, registering variables such as frequency, spectrum, modulation, among others, seeking to obtain a pattern of identification and classification according to gender through a voice identifier. The data record used is in open access and can be downloaded from the Kaggle web platform via <https://www.kaggle.com/primaryobjects/voicegende>r. For the development of the algorithm’s model, the statistical program R was used. Additionally, applications were made with Python by the development of classification algorithms.