To decide whether to break a node into two or more sub-nodes, decision trees employ a variety of techniques. The homogeneity of the generated sub-nodes improves with the generation of sub-nodes. To put it another way, the purity of the node improves as the target variable grows.
ID3 stands for Iterative Dichotomiser 3, and it is so named because the method separates features into two or more groups iteratively (repeatedly) at each stage. ID3 is a top-down greedy way to building a decision tree that was invented by Ross Quinlan.
Learner's Ratings
4.3
Overall Rating
67%
11%
12%
5%
5%
Reviews
S
Suresh Kumar
5
Hi Sir,
I want a clearity up on these
1. To learn Data Science "Machine learning" is part of it but we have to learn additionally python libraries (panda, numpy, matplotlib) or else in ML enough.
A
Ayush Bharti
4
how can i download the finaldata.csv?
J
Jagannath Mahato
5
Hello Kushal Sir!
Your way of teaching is very good. I thank you from my heart ❤️ that you are providing such good content for free.
M
Muhammad Qasim
5
Hi Kushal ! Your way of teaching is extremely helpful and you are one of the best teacher in the world.
Extremely helpful and I recommend to my peer as well for this course.
S
Shafi Akhtar
5
None
A
Aniket Kumar prasad
5
Very helpful and easy to understand all the concepts, best teacher for learning ML.
R
Rishu Shrivastav
5
explained everything in detail. I have a question learnvern provide dataset , and ppt ? or not?
V
VIKAS CHOUBEY
5
very nicely explained
V
Vrushali Kandesar
5
Awesome and very nicely explained!!!
One importing thing to notify to team is by mistakenly navie's practical has been added under svm lecture and vice versa (Learning Practical 1)
Share a personalized message with your friends.