Learning, in Machine Learning (ML) area, is one of the most important steps in the construction of algorithms that seek to predict a certain task, whether this is the classification of objects, the forecast of demand for a specific product or even the diagnosis of malignant diseases. In ML, we can study supervised (which have a label, e.g., a class) and unsupervised algorithms, used for tasks such as pattern detection, grouping, among others that do not depend directly on a label. Knowing this, the present work aims to carry out the study of different supervised learning algorithms, in this case, the classification algorithms, more specifically Decision Trees, to carry out an analytical study about the steps that make up the learning process of the algorithm, exploring concepts of the statistical learning theory (SLT) that provide tools for studies and allow to prove issues such as the guarantee of learning of a certain algorithm. Reference: Rodrigo Fernandes de Mello, Chaitanya Manapragada, Albert Bifet: "Measuring the Shattering coefficient of Decision Tree models". Expert Syst. Appl. 137: 443-452 (2019)<DOI:10.1016/j.eswa.2019.07.012>.
|Author||Igor Martinelli [aut, cre]|
|Maintainer||Igor Martinelli <email@example.com>|
|Package repository||View on CRAN|
Install the latest version of this package by entering the following in R:
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.