Decision Tree problem / Finding Best Split using Information Gain

#decisiontree #id3 #splittingattribute
Decision tree problem
This video gives you an idea about finding the best splitting attribute of a decision tree. This method uses entropy and information gain as the measures.

[@anirudh7150]

Thank you Ma'am. It was really helpful.

[@edwardjames7295]

Watching from US. The previous paper based explanations are wonderful. Also no one explained this much clearly. Please do with paper if possible.

[@eduflairktucs7636]

Next time i will try to make such videos. Thanks for your comment.👍

[@letlhogonolonape849]

This is helpful thanks, you really make it to look easy. Could you also do one where you do this for the whole tree please. I'm a bit confused because now we have one parent node, after splitting on age then what then because now we are going to have 3 nodes.

[@jamesdavid2492]

This is wonderful,, thanks

[@eduflairktucs7636]

Glad you like it!

[@pradeep4936]

Can you please upload the notes of the lectures in the machine learning playlist? Only some lectures have notes uploaded

[@Shanksyt4743]

Give another feature in this data set madam

[@athuljoby2806]

nicezzyy

[@rahuldhar7784]

Its attribute .... not attriboot...

[@Michaeldonkor-mf6hp]

😂😂😂ooh chaley