Scribd
Upload
5 views

Decision Tree

Decision Tree is a supervised learning technique primarily used for classification problems, structured as a tree with decision nodes and leaf nodes. It utilizes the CART algorithm to recursively split data based on features, creating a visual representation of decision-making processes. Key terminologies include root node, leaf node, splitting, pruning, and the overall logic mimics human decision-making, making it easy to understand.

Uploaded by

vansh sharma
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
5 views

Decision Tree

Decision Tree is a supervised learning technique primarily used for classification problems, structured as a tree with decision nodes and leaf nodes. It utilizes the CART algorithm to recursively split data based on features, creating a visual representation of decision-making processes. Key terminologies include root node, leaf node, splitting, pruning, and the overall logic mimics human decision-making, making it easy to understand.

Uploaded by

vansh sharma
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 24

DECISION TREE

Decision Tree Classification


Algorithm
• Decision Tree is a Supervised learning technique that can be used for both
classification and Regression problems, but mostly it is preferred for solving
Classification problems. It is a tree-structured classifier, where internal nodes
represent the features of a dataset, branches represent the decision
rules and each leaf node represents the outcome.
• In a Decision tree, there are two nodes, which are the Decision Node and Leaf
Node. Decision nodes are used to make any decision and have multiple branches,
whereas Leaf nodes are the output of those decisions and do not contain any
further branches.
• The decisions or the test are performed on the basis of features of the given
dataset.
• It is a graphical representation for getting all the possible solutions to a
problem/decision based on given conditions.
• It is called a decision tree because, similar to a tree, it starts with the root node,
which expands on further branches and constructs a tree-like structure.
• In order to build a tree, we use the CART algorithm, which stands
for Classification and Regression Tree algorithm.
• A decision tree simply asks a question, and based on the answer (Yes/No), it
further split the tree into subtrees.
Representation of Decision Tree
A decision tree can contain categorical data (YES/NO) as well as numeric data
Why we use Decision Tree
• Decision Trees usually mimic human thinking ability
while making a decision, so it is easy to understand.
• The logic behind the decision tree can be easily
understood because it shows a tree-like structure.
Decision Tree Terminologies

•Root Node: Root node is from where the decision tree starts. It represents
the entire dataset, which further gets divided into two or more homogeneous
sets.
•Leaf Node: Leaf nodes are the final output node, and the tree cannot be
segregated further after getting a leaf node.
•Splitting: Splitting is the process of dividing the decision node/root node
into sub-nodes according to the given conditions.
•Branch/Sub Tree: A tree formed by splitting the tree.
•Pruning: Pruning is the process of removing the unwanted branches from
the tree.
•Parent/Child node: The root node of the tree is called the parent node,
and other nodes are called the child nodes.
How does the Decision Tree
algorithm Work
• Step-1: Begin the tree with the root node, says S, which contains
the complete dataset.
• Step-2: Find the best attribute in the dataset using Attribute
Selection Measure (ASM).
• Step-3: Divide the S into subsets that contains possible values
for the best attributes.
• Step-4: Generate the decision tree node, which contains the best
attribute.
• Step-5: Recursively make new decision trees using the subsets
of the dataset created in step -3. Continue this process until a
stage is reached where you cannot further classify the nodes and
called the final node as a leaf node.
Example
Suppose there is a candidate who
has a job offer and wants to
decide whether he should accept
the offer or Not. So, to solve this
problem, the decision tree starts
with the root node (Salary
attribute by ASM). The root node
splits further into the next
decision node (distance from the
office) and one leaf node based
on the corresponding labels. The
next decision node further gets
split into one decision node (Cab
facility) and one leaf node. Finally,
the decision node splits into two
leaf nodes (Accepted offers and
Declined offer).
Example

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy