Ensemble Technique 1 : Random Forest

 Random Forest





Ensemble technique is a technique where we combine multiple models and random forest is an ensemble technique with multiple decision trees. Random forest comes under bagging technique (also know as bootstrap aggregation).


Bagging Technique




Source: Wikipedia


Consider the above picture, where we have an original data, D(say). Similarly we have  multiple base learners or base models or classifiers , M1, M2,...Mn(say). Each models is provided with a sample of data (D') and the sampling of data for each model will be row sampling with replacement. Each model will get trained on that sample of data.
Suppose once the model is trained, test data is provided for validation of each model. As each model will come up with an output, based on voting classifier the majority of the output will be taken as final output for classification. For example, if from above figure, if majority of the classifier give blue as the output, we take blue as our final output. In this case, bootstrapping is basically generating multiple models from a single data and aggregation is combining the output(in this case taking the majority option).


Random Forest
Now we know what a bagging technique means, so random forest is a bagging technique with multiple decision tree models.  


Source: My rough notebook



Suppose we have a data 'D' with d number of records and n number of columns. In this case we have multiple decision tree as our base models (M1, M2, M3, ...Mn). Here for sampling of data(D') to each decision tree models we do both row sampling with replacement(RS) and feature sampling with replacement(FS) together. One need to keep in mind is if the original data set has D number of records and the sample has D' number of records then always D>D' and same in case of features (m > n, where number of column of original data and sample are m and n respectively). 
When we get the test data, each decision tree will give us an output. For aggregating we use voting classifier and this is called aggregation.

Let us analyse why to use a ransom forest instead of a single decision tree model.

Reason 1
Decision tree has 2 properties:
  1. Low bias: If decision tree is created to its complete depth then the model will get trained properly for training dataset. That is the training error will be less in this scenario. 
  2. High variance: Decision tree models are prone to give larger amount of error when test data is used for validation. This would result in an issue we call as overfitting.
So in case of random forest, as there are multiple decision trees with high variance. But when we combine all the model with maximum vote aggregation, the high variance will get converted to low variance. Each set of RS and FS will make the single base decision tree model expert with that sample and hence will lead to high variance. To convert high to low variance, we do aggregation as mentioned.


Reason 2
Suppose we make changes in the total number of records in the original data with 1000 resords(say). Eg, we make changes in 200 records(say). In this case, these new records will get evenly distributed on all the decision trees and hence there would not be much impact (in terms of accuracy) on the decision tree.


Note: In case of a regression problem, we take either the mean or median of the decision tree outputs as aggregation depending on the distribution of the data.


References:
  1. YouTube Channel - Krish Naik
  2. Wikipedia

Comments

Post a Comment

Popular posts from this blog

Euclidean Distance and Manhattan Distance

Image
  Euclidean and Manhattan Distance Euclidean Distance and Manhattan Distance are the two distances that we generally use to find distance between two data points. Use of this distance can be seen in algorithms like KNN, Kmean and Hierarchical clustering. We can check if there are any similarities between the two data points with the help of these distances. Euclidean distance The smallest possible distance between any two points is named as euclidean distance. This distance is calculated based on Pythagoras theorem as shown in the below figure. Source:  cdn-images-1.medium.com This is the case for 2-D data.  For higher dimensions we can add the additional dimension. This is case for any number of dimensions. Euclidean distance is used where we calculate the distance between any two points in a straight line irrespective of whether there are any other data points in between them. Ex. when we google to check distance between Cochin and Delhi in case of flight we get a straight point from
Read more

k-nearest neighbor

Image
 KNN The k-nearest neighbor algorithm is a supervised machine learning algorithm that can be used to solve both classification and regression problems. Classification usage Let us understand the algorithm using the below figure where we have two classes of data points ( A and B).  Source:  www.kdnuggets.com The first step is to determine the K value ( 'k' here is the number of nearest data points from the new data point). Let us take k = 3 as per the above figure. We can see that 2 out of 3 neighbors are from class B. So, in this case we go with the majority votes, i.e., the new data point will be classified as class B. We can use either Euclidean or Manhattan distance to get the nearest neighbor. Regression usage Below we can see the difference in the regression and classification usage. We will focus on the left figure for regression under this topic. Source:  www.jeremyjordan.me Similar to the classification problem, here also we need to come up with a k value. If the k val
Read more

K means clustering

Image
 K means clustering K-means  is a non-parametric method of clustering where we pre define the number of clusters(non-parametric means computation complexity depends in number of samples). It is an unsupervised machine learning technique. Source: miro.medium.com From the above figure, the algorithm finds the similarity between points and group them into clusters (green, blue and red in this case). Let us see what are the steps required and how the algorithm arrived at 3 clusters as above. Determine K value:  K value is basically how many centroids is needed for our data to form the best clusters. Here we can take any value for beginning.  Initialize K points (randomly) as cluster centers in the plane( K = 3 in this case) Find the distance between the points nearer to the centroids:  Here we can calculate the distance either using Euclidean and Manhattan Distance (Click here to know more about these distance). Based on the shortest distance from the centroids, clusters are formed. Sele
Read more