DECISION TREE
DECISION TREE
Page No.:
HOt
Higb Ho
Hgh
Overaut HOt tléak Ye
Kain Weak Hormay yes
5 Kafn Coo1 Homa yes
6 Kafn Coo1 Stong Hona Ho
Overco0t 1COo| 9Hiqh d yes
1faeak Horma1o
eak NOrma Yes
Kaln MId (4eak HOrmay
12 QveScaut High tr ye
13 Oyercaut stoong HormayS
14 Kaio HigS
>7iagram 1
9-yes 5-N0
:Outlook'
es]2-NO
Overraut
tyes ONO
príty sptit check
Wbether optit pure in pure
Entsopy ) meaje of
trnpurit
Gini Imprity
MT T F S S
there Page No.:
YOUVA
D-yg 3-NO Date:
9yes|s-NO1
Jmpure spfit Outlook
4-yesCO-NO
Overrau) Kalo
1
M T WT F S S
Page No.:
YOUVA
Date:
G-yeg g-NO
()
leaf node
Pt: 3-yes
3-yes t g-NO probabitity p Of
post
B-NO 3
3-es t3-NO 6 2
H CC) = -3
6 6
13 3
pure Spi
po!
(e if probabftityof PtjP
qet entsop4 of 1
M T W
Page No
YOUVA
Date:
I-PCp)
pure ptt
eotoop
o-S
pt,p
Consider elassifroio probie
3
entropy
HeS) =-Pej loqe Pe1 - Pca lo9 Pe2- pcs to9g Pe3
’ Gint entropy
GI + Cpo+ Cpg)
Page No
YOUVA
Gate
14
O-94
o-81
Page No.
YOUVA
Date:
entooPy
the datuet Sma Shod
entropy. Lioq formwa 4akes +fne
) beneve the datauet1 19 Buge Shoy
Gfo? entoopy simple math’ take (ess
Ho mny
yeo
than e qual
t0 29
1-yes,
Ftsadvantaq : ) we need Create decision tree fos
each and every thshold
TIme -0hen datue
buge.
MT W
|Page No
YOUVA
Date
This
cpittng CootinQusly
going the Jeaf
node oCCerSy
Nheoever Spfit +be
decisio toeto1tS depth ti| lef dode
|eads overfiHing
AccCuray ubigh T i i 1
TeSt data accu o0.
Page No.
YOUVA
Date:
7ECISON TReEREGRESSORt
regrp Ssion problemGtaregent
be ConHDow.
> Congider he datset
Exp Career qap 9alary COutput ) - Cootinouy
yes
yes
52k
4
45 yes
y=SoK- Avg Slary (m ean
Start Splitinq Exp feature "
]threshol d \raueA
4K,52k,60k, 5GK
2) tseshold vaue 25
1
yes
40,42K
’Varfance (ROot )
4o-so)°+ C43-s64Ce2-ro
+(60-so +(s6-SO)
Page No
YOUVA
Dete
varlrool G08
/ariane Cref) Cko-s0
reduton
448c + too
Varince
redwO 60-8 X82 4666
VariOnce recu
Which Spu+ should
wh ose
vartance eduwton t bigb.