# What Are Decision Trees And How Do They Work? (From Scratch) | Summary and Q&A

11.2K views
August 10, 2021
by
Abhishek Thakur
What Are Decision Trees And How Do They Work? (From Scratch)

## TL;DR

Decision trees are a visual representation of the decision-making process, where each node represents a condition and directs the path of the decision based on the condition's outcome. Decision trees can be used for classification and regression problems.

## Key Insights

• 💄 Decision trees are a visual representation of the decision-making process, making it easier to understand and interpret.
• 🌲 The impurity of a decision tree can be measured using Gini impurity or entropy, with the goal of minimizing impurity at each node.
• 🌲 Decision trees can handle categorical variables by assigning numerical values to each category.
• 🌲 The decision tree-building process involves recursively splitting the data based on the most informative conditions.

## Transcript

hello everyone and welcome to my youtube channel in today's video i'm going to show you what decision trees are and how they work and i hope it's useful for you so let's get started so here is my blackboard and you must have seen pictures like this so things like this if you have seen things like this then you have already seen decision trees yeah ... Read More

### Q: How are decision trees structured?

Decision trees consist of nodes, which represent conditions, and branches, which represent the outcomes based on those conditions. They start with a root node and split into decision and leaf nodes.

### Q: How is impurity measured in decision trees?

Impurity in decision trees can be measured using metrics such as Gini impurity and entropy. Gini impurity is calculated as the sum of the probabilities of each class multiplied by 1 minus the probability of that class. Entropy is similar, but the probabilities are multiplied by their logarithms.

### Q: How does a decision tree handle categorical variables?

Categorical variables in a decision tree can be represented by assigning numerical values to each category. The decision tree can then use these numerical values to determine the path of the decision.

### Q: How is the best split chosen in a decision tree?

The best split in a decision tree is chosen based on the reduction in impurity. The split that results in the largest reduction in impurity is selected, as it provides the most information gain.

### Q: How is a decision tree built?

Decision trees are built by recursively splitting the data based on conditions that reduce impurity. The process continues until a certain stopping criterion is met, such as reaching a maximum tree depth or a minimum number of samples per leaf.

### Q: How does a decision tree handle missing values?

Decision trees can handle missing values by assigning them to the most common class or by using surrogate splits, which create additional branches to account for missing values.

## Summary & Key Takeaways

• Decision trees are a visual representation of decision-making processes, with nodes representing conditions and branches representing outcomes based on those conditions.

• The probability of a sample belonging to a certain class can be calculated at each node, based on the number of samples in each class.

• Impurity in decision trees represents the mixture of classes at a node, and it can be measured using metrics such as Gini impurity or entropy.

• The impurity is minimized when building a decision tree by choosing conditions that reduce impurity the most.

• The basic building block of a decision tree is a decision node, which splits samples based on a condition, and leaf nodes, which represent the final predicted class.