[MXML-2-07] Decision Trees [7/11] - CART, Decision Tree from scratch, using recursion

* This video was produced in Korean and translated into English. And the voice is generated by AI TTS. The English translation may contain grammatical errors.

In the last video, we used Gini index and information gain to find the most efficient split point, and created the optimal tree using this split point. We also learned how to find the best split point for the numerical features. The intermediate points were used for splitting.

In this video, we will use what we learned above to write code that implements classification. Let's create a Python class for a decision tree classifier. We'll write code that performs classification by creating a binary tree using recursive method. And We will do the same thing using scikit-learn's Decision Tree library and compare the two results.

#DecisionTree #CART #DecisionTreeFromScratch #BinaryTree #Recursion #InformationGain #GiniIndex #IG