Scribd
Upload
5 views

Lecture 7.1 - Decision Tree Classification

Uploaded by

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

Lecture 7.1 - Decision Tree Classification

Uploaded by

suryapratp369
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 15

• Decision Tree Classification

Algorithm

Dr. Jagendra Singh


What is Decision Tree Classification
Algorithm?

o Decision Tree is a Supervised learning technique that can


be used for both classification and Regression problems.
o It is a tree-structured classifier, where internal nodes
represent the features of a dataset
o branches represent the decision rules and
o each leaf node represents the outcome.
o In a Decision tree, there are two nodes, which are
the Decision Node and Leaf Node.
o Decision nodes are used to make any decision and have
multiple branches.
What is Decision Tree
Classification Algorithm?
o The decisions or the test are performed on the basis
of features of the given dataset.
o 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.
o In order to build a tree, we use the CART
algorithm, which stands for Classification and
Regression Tree algorithm.
o A decision tree simply asks a question, and based on
the answer (Yes/No), it further split the tree into
subtrees.
Decision Tree Classification
Algorithm
o This diagram explains the
general structure of a decision
tree:
• Note: A decision tree can contain
categorical data (YES/NO) as
well as numeric data.
Why use Decision Trees?
Below are the two reasons for using the
Decision tree:
o Decision Trees usually mimic human thinking
ability while making a decision, so it is easy to
understand.
o The logic behind the decision tree can be
easily understood because it shows a tree-like
structure.
The complete process can be better understood using the
below algorithm:
o Step1: the tree with the root node, says S, which
contains the complete dataset
o Step-2: Find the best attribute in the dataset
How does the using Attribute Selection Measure (ASM).
Step-3: Divide the S into subsets that contains possible
Decision Tree
o

values for the best attributes.


Step-4: Generate the decision tree node, which contains
algorithm Work? o

the best attribute.


o 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).

Consider this diagram:


• While implementing a Decision tree, the main
issue arises that how to select the best attribute
for the root node and for sub-nodes.

Attribute • So, to solve such problems there is a technique


which is called as Attribute selection measure
or ASM.

Selection • By this measurement, we can easily select the


best attribute for the nodes of the tree. There are

Measures o
two popular techniques for ASM, which are:
Information Gain
o Gini Index
o According to the value of information gain,
we split the node and build the decision tree.
o A decision tree algorithm always tries to

Information maximize the value of information gain, and


a node/attribute having the highest
information gain is split first.

Gain o It can be calculated using the below formula:


Information Gain= Entropy(S)-
[(Weighted Avg) *Entropy(each feature)
• Entropy: Entropy is a metric to measure
the impurity in a given attribute. It
specifies randomness in data. Entropy can
be calculated as:

Information
• Entropy(s)= -P(yes)log2 P(yes)-
P(no) log2 P(no)

Gain • Where,
o S= Total number of samples
o P(yes)= probability of yes
o P(no)= probability of no
Gini Index
o Gini index is a measure of impurity or purity used while creating a
decision tree in the CART(Classification and Regression Tree) algorithm.
o An attribute with the low Gini index should be preferred as compared to
the high Gini index.
o It only creates binary splits, and the CART algorithm uses the Gini index to
create binary splits.
o Gini index can be calculated using the below formula:
• Gini Index= 1- ∑jPj2
Advantages of the Decision Tree
o It is simple to understand as it follows the same process which a
human follow while making any decision in real-life.
o It can be very useful for solving decision-related problems.
o It helps to think about all the possible outcomes for a problem.
o There is less requirement of data cleaning compared to other
algorithms.
Disadvantages of the Decision Tree
o The decision tree contains lots of layers, which makes it
complex.
o It may have an overfitting issue, which can be resolved using
the Random Forest algorithm.
o For more class labels, the computational complexity of the
decision tree may increase.
Python Implementation of Decision Tree

• Now we will implement the Decision tree using Python. For this, we will use the dataset
"user_data.csv,"

Steps will also remain the same, which are given below:
o Data Pre-processing step
o Fitting a Decision-Tree algorithm to the Training set
o Predicting the test result
o Test accuracy of the result(Creation of Confusion matrix)
o Visualizing the test set result.
Thank you

You might also like