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 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. Below diagram explains the general structure of a decision tree:

 There are various algorithms in Machine learning, so choosing the best algorithm for the given dataset
and problem is the main point to remember while creating a machine learning model. Below are the
two reasons for using the 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?
In a decision tree, for predicting the class of the given dataset, the algorithm starts from the root node of the
tree. This algorithm compares the values of root attribute with the record (real dataset) attribute and, based on
the comparison, follows the branch and jumps to the next node. For the next node, the algorithm again
compares the attribute value with the other sub-nodes and move further. It continues the process until it reaches
the leaf node of the tree.
The complete process can be better understood using the below algorithm:
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).
Consider the below diagram:
ADVANTAGES OF THE DECISION TREE
 It is simple to understand as it follows the same process which a human follow while making any
decision in real-life.
 It can be very useful for solving decision-related problems.
 It helps to think about all the possible outcomes for a problem.
 There is less requirement of data cleaning compared to other algorithms.
DISADVANTAGES OF THE DECISION TREE
 The decision tree contains lots of layers, which makes it complex.
 It may have an overfitting issue, which can be resolved using the Random Forest algorithm.
 For more class labels, the computational complexity of the decision tree may increase.

RANDOM FOREST ALGORITHM

Random Forest Algorithm Random Forest is a supervised machine learning algorithm made up of decision
trees. Random Forest is used for both classification and regression—for example, classifying whether an email
is “spam” or “not spam”. It is based on the concept of ensemble learning, which is a process of combining
multiple classifiers to solve a complex problem and to improve the performance of the model.
As the name suggests, "Random Forest is a classifier that contains a number of decision trees on various
subsets of the given dataset and takes the average to improve the predictive accuracy of that dataset." Instead
of relying on one decision tree, the random forest takes the prediction from each tree and based on the majority
votes of predictions, and it predicts the final output.
THE FOLLOWING STEPS EXPLAIN THE WORKING RANDOM FOREST ALGORITHM:
WORKING OF RANDOM FOREST ALGORITHM:
HOW DOES RANDOM FOREST ALGORITHM WORK?
Random Forest works in two-phase first is to create the random forest by combining N decision tree, and
second is to make predictions for each tree created in the first phase. The Working process can be explained
in the below steps and diagram:
 Step-1: Select random K data points from the training set.
 Step-2: Build the decision trees associated with the selected data points (Subsets).
 Step-3: Choose the number N for decision trees that you want to build.
 Step-4: Repeat Step 1 & 2.

Finally, select the most voted prediction result as the final prediction result.
This combination of multiple models is called Ensemble. Ensemble uses two methods:
1. Bagging: Creating a different training subset from sample training data with replacement is called
Bagging. The final output is based on majority voting.
2. Boosting: Combing weak learners into strong learners by creating sequential models such that the
final model has the highest accuracy is called Boosting.

APPLICATIONS OF RANDOM FOREST

There are mainly four sectors where Random Forest mostly used:
 Banking: Banking sector mostly uses this algorithm for the identification of loan risk.
 Medicine: With the help of this algorithm, disease trends and risks of the disease can be identified.
 Land Use: We can identify the areas of similar land use by this algorithm.
  Marketing: Marketing trends can be identified using this algorithm.
ADVANTAGES OF RANDOM FOREST
I. Random Forest is capable of performing both Classification and Regression tasks.
II. It is capable of handling large datasets with high dimensionality.
III. It enhances the accuracy of the model and prevents the overfitting issue.

DISADVANTAGES OF RANDOM FOREST

Although random forest can be used for both classification and regression tasks, it is not more suitable for
Regression tasks.
IMPLEMENTATION STEPS ARE GIVEN BELOW:
 Data Pre-processing step
 Fitting the Random Forest algorithm to the Training set
 Predicting the test result
 Test accuracy of the result (Creation of Confusion matrix)
 Visualizing the test set result.
 Difference Between Decision Tree and Random Forest
 Random forest is a collection of decision trees; still, there are a lot of differences in their behavior.

Decision trees Random Forest

1. Decision trees normally suffer from the 1. Random forests are created from subsets of data, and the
problem of overfitting if it’s allowed to grow final output is based on average or majority ranking; hence the
without any control. problem of overfitting is taken care of.
2. A single decision tree is faster in 2. It is comparatively slower.
computation.
3. When a data set with features is taken 3. Random forest randomly selects observations, builds a
as input by a decision tree, it will decision tree, and takes the average result. It doesn’t use any set
formulate some rules to make of formulas.
predictions.