A Simple Guide to Decision Tree

Decision Tree is one of the most intuitive families of algorithms. It is extremely easy to understand.

As the name describes, it is a tree which helps us in making decisions. Decision trees can handle non-linearity in data. Decision trees are capable of complex methods of separation through easy computational methods.

Is the above data linearly separable?

No. This is where Decision Trees are very useful.

There are two types of Decision Trees which are based on the type of target variables (output variables):

We need to understand few basic terminologies used with Decision trees:

That’s great, as we have learned all the terminology let’s dive in a little bit deeper and understand how exactly decision tree works.

Decision trees use multiple algorithms to decide to split a node into two or more sub-nodes.

Splits are done based on

We will cover this in my future post here, I will go through the different splits in python which will give you a better understanding of how exactly the algorithm splits a node.

I hope you have got an intuition about how a Decision Tree Algorithm works.

Thanks for Reading! :) ❤

Related posts:

Yesterday was another eventful day in the world of cryptocurrencies. Bad news hits the web, and everything comes tumbling down. So what happened this time? You guessed it — more regulation. According…

It is a both a dangerous and unique time in humanity’s history. Everyone is divided, and unity proves elusive. From the “Trumper” conservative right, to libertarians, to the liberals and the SJWs……

Living a life of fear, anxiety and self-centeredness is a lonely one. That was my life for well over half a century. My weak ego was a wonder to see. I was the most interesting person I knew. Just…