Scribd
Upload
35 views

Decision Tree

A decision tree is a hierarchical model used to represent a series of decisions and their possible consequences. It starts with a root node and ends with a decision made by leaf nodes. Decision trees are used for classification and regression tasks in machine learning and provide easy-to-understand models.

Uploaded by

bhavana vashishtha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
35 views

Decision Tree

A decision tree is a hierarchical model used to represent a series of decisions and their possible consequences. It starts with a root node and ends with a decision made by leaf nodes. Decision trees are used for classification and regression tasks in machine learning and provide easy-to-understand models.

Uploaded by

bhavana vashishtha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Decision Tree

A decision tree is a tree-like structure that represents a series of decisions and


their possible consequences. It is used in machine learning for classification
and regression tasks. An example of a decision tree is a flowchart that helps a
person decide what to wear based on the weather conditions.

What is a Decision Tree?


A decision tree is a non-parametric supervised learning algorithm for
classification and regression tasks. It has a hierarchical tree structure
consisting of a root node, branches, internal nodes, and leaf nodes. Decision
trees are used for classification and regression tasks, providing easy-to-
understand models.
A decision tree is a hierarchical model used in decision support that depicts
decisions and their potential outcomes, incorporating chance events, resource
expenses, and utility.

The name itself suggests that it uses a flowchart like a tree structure to show
the predictions that result from a series of feature-based splits. It starts with a
root node and ends with a decision made by leaves.
Terminologies used in Decision Trees
 Root Node: The initial node at the beginning of a decision tree, where the
entire population or dataset starts dividing based on various features or
conditions.
 Decision Nodes: Nodes resulting from the splitting of root nodes are
known as decision nodes. These nodes represent intermediate decisions or
conditions within the tree.
 Leaf Nodes: Nodes where further splitting is not possible, often indicating
the final classification or outcome. Leaf nodes are also referred to as terminal
nodes.
 Sub-Tree: Similar to a subsection of a graph being called a sub-graph, a
sub-section of a decision tree is referred to as a sub-tree. It represents a
specific portion of the decision tree.
 Pruning: The process of removing or cutting down specific nodes in a
decision tree to prevent overfitting and simplify the model.
 Branch / Sub-Tree: A subsection of the entire decision tree is referred to
as a branch or sub-tree. It represents a specific path of decisions and outcomes
within the tree.
 Parent and Child Node: In a decision tree, a node that is divided into sub-
nodes is known as a parent node, and the sub-nodes emerging from it are
referred to as child nodes. The parent node represents a decision or condition,
while the child nodes represent the potential outcomes or further decisions
based on that condition.
Example of Decision Tree
Let’s understand decision trees with the help of an example:
In the below diagram the tree will first ask what is the weather? Is it sunny,
cloudy, or rainy? If yes then it will go to the next feature which is humidity
and wind. It will again check if there is a strong wind or weak, if it’s a weak
wind and it’s rainy then the person may go and play.

You might also like