Decision Tree
I is a rule-based AI model which helps he machine in predictng wha anelemen is
wih he help o various decisions (or rules) ed o i.The basic srucure o
a Decision Tree sars rom he ROOT which he poinwhere he decision ree
sars. From here, he ree diverges ino multpledirectons wih he help o
arrows called BRANCHES. These branches depic heconditon because o which he
ree diverges. In he end, he fnal decision iswhere he ree ends. These
decisions are ermed as he LEAVES o he ree. Youwould realize ha his looks
like an upside-down ree
Here, he Decision ree sars rom he queston Am I Hungry? The beginningpoin
o any Decision Tree is known as is Roo. I hen orks ino wo dierenways
or conditons: Yes or No. The orks or diversions are known as Branches o he
ree. The branches eiher lead o anoher queston, or hey lead o adecision like
Go o Sleep which is known as he lea. I you look closely a heimage above,
you would notce ha i looks like an invered ree wih rooabove and he
leaves below. Hence he name Decision Tree!Decision Trees are made on he basis
o he daase we have and changeaccording o he parameers which we ake ino
consideraton or [Link] tmes, he daase migh have redundan daa,
ha is, some daa mighno hold imporance while developing he decision ree.
For his, one needs ovisualise he relaton amongs all he parameers given in
he daa and henormulae he model
