DM Assignment 1
DM Assignment 1
Hoo
A%sociation mules, comiftcation Can bebe wsed for analyts ,
Student potmane
Data mining is proen o sttng thoough Loouge
sts to fdentfy atterna and dota
solve buntnes pnblema though melattonhps that can help
data analysrs.
clasiffcation
a) cuutení ng
3) Assbcí atíon rules
4) Regrnien
5) Duíatíon Joutie dete ctio
’camiatten Dt fnvolves amigning aa clas label to each
?stanee în a dat et ba ed on (ts teates. Itt
is to build model thot
qoal
acwataly prredut elas labels
new fstanes based
Dn t treatus.
is o tuoo typs bínaoy elantfatón yOnly too
close Soch as Spaun , not span'
mutti lan clasifauin
’ moe tnon
OccUt
tathn as penceotaqe o all thansadtions
Congidence s- e tells how teguntly' an item o(lwy
qraden nd
Getween shuy habits ç
sudy stonges 9 pomo them amonq all studen
-Atendence Gpyomance: Tdentify Lnes btw atendene
ptovmae
Can hiqhiaht innportane o_ veqular endene o acodemic Succe
Extacuoúculas Aciitles- Rweols how s tudents cngaqed in Speufc
eytiacwlar acttuitie tends to ptorm bette
cloniatien r s in Student Po7ormone i
woounna
Students
S4steen i- betldfnqa nodel, sc hool can predrct
(35milonity)
fordSaeK, Many)
Aegmbic
Jack
3 (e)
d(Gat Mag) o.5
1+)
R
l(9) Ol) =0.5
Jack
lo 3 (t)
d(Tace, Sim)
3. nterpretalin
for îytance if sud alen
Sales
fs pbsewed domaln Enoole de míqh alv
bite to cole
weathe Totfaes han fauttey aata
pornt;
o)
h.0-|h
9
()naddns
rodens (9)
gtt.0 gt> %9-tE X
oddns to(a)
) Data
elcontng'
4hat
They Can ond f ecitiy data in(onsislen
6e lniue to
Cente ual insiqht:- Dx
ndithy
aloe analyst< to add
conlexl l hudi
Tey Can deteíne new thend r
Jong
8) BoTaqçted Deciseen Matínq' ith domain inoights the bntinc
Sye (an make fnomed odeersíons uth ay inbodie(ny
pvdutt line based on (dentfred Custom Peaenee.
finally hís alloo to enchance 2uaity e veleuant entocteA
inihts hdance d undetandng
he data lcading betten de cistens stiateqfes sothin înalujtby
fnd te teguent tem sets fpom tolloofng Gansaetion dataset
wsfng aprierf algorfhm oitth mfnimu Suppost =3
Dtemset
{a,d,e 3
Sab, c,e
3 { a,brd, e?
a,c, d, eB
b, dy e?
{ a,d,e
{aib,et
6) Contuet
set
ctuong
wstng apri
asoration rules tor above eguent î ten
algoithm itfh conhrdenee H52
Suppot Ca,e,b)
t - 0-5
tuppot (a,ey
Suppot (a,b,e) 0.16O.a5=
Suppovt (ab)
fos fa, 4, e uppotfa
{at d,e? - Sppot a,4,e)
Suppot (a)
euppot (a , e
erppot (dy
Suppot( aid, e) o.52o 5
1,,32,S4
ot
13,T4
altu thayacfen 5
tiee
3 /.
T3:5.
fnestíciencíes.
8) Psedictíve
roalysis' By ralqzing hctoñe dlata bants can
he matet conditíons lvtnest ratos predtct
enaldlna betes decíelen motfng.