This course introduces classification and regression trees (CART), random forest, and XGBoost machine learning algorithms using the R programming language.

Dockerfile.tar.gz

tidymodels

The R programming language is widely used in the field of data science. Machine learning is a fundamental skill for learners looking to master industry algorithms in the field of data science.

In this course, you’ll learn about several essential algorithms used in machine learning, including classification and regression trees (CART), random forest, and XGBoost. CART is a decision tree algorithm that’s used for both classification and regression problems. Random forest is an ensemble learning method that uses multiple decision trees to improve the accuracy of predictions. XGBoost, short for Extreme Gradient Boosting, is a powerful algorithm that’s also used for regression and classification problems. You’ll also learn about cross-validation and model tuning, which are essential skills for crafting valuable machine learning models. 

After taking this course, you’ll have the crucial skills to ensure that the machine learning models you create are accurate, robust, and reliable.

Data Science with R: Decision Trees and Random Forests

What is the Gini impurity of the label grouping second from the left in the following image?

<img src="/udata/ngYRzdD08vW/GiniQuiz.png" loading="lazy" />

What is the Gini impurity of the label grouping second from the left in the following image?
<img src="/udata/ngYRzdD08vW/GiniQuiz.png" loading="lazy" />

What is the Gini impurity of the label grouping second from the right in the following image?

<img src="/udata/ng72Dnxm6PG/GiniQuizImage.png" loading="lazy" />

What is the Gini impurity of the label grouping second from the right in the following image?
<img src="/udata/ng72Dnxm6PG/GiniQuizImage.png" loading="lazy" />

**(True or False)** The CART classification tree algorithm's objective is to maximize Gini impurity.

(True or False) The CART classification tree algorithm’s objective is to maximize Gini impurity.

**(True or False)** The CART classification tree algorithm picks splits with the highest Gini gain.

(True or False) The CART classification tree algorithm picks splits with the highest Gini gain.

**(True or False)** In the Gini gain calculation, the parent node refers to calculating Gini impurity for all training data observations.

(True or False) In the Gini gain calculation, the parent node refers to calculating Gini impurity for all training data observations.

Test what you’ve learned about the classification tree math.

Welcome to the Course

Supervised Learning

Classification Tree Math

Using Classification Trees in R

Introducing the Bias-Variance Tradeoff

Model Tuning

Model Tuning with tidymodels

Feature Engineering

Regression Trees

The Random Forest Algorithm

Using Random Forests

Gradient Boosting Trees

Continuing Your Journey

Quiz: Classification Tree Math