Bca VI May2017 Data Mining and Data Warehousing
Bca VI May2017 Data Mining and Data Warehousing
SECTLON ' A
lonewordanswefl (8r0.5=4)
c) The task ol qrouping se1 ol oblecls n slch a way thal oblecls n lhe same
-',r.upio.6*"lti"rutt.eachoiherihanlothoseinothergroupslscaled
d) / useo aodsu eq Io sarp''
nleresUng association rules
e) B FCH is an examPle rora -- rype c ustering
a goritli m
t) -
c usteinq iechnlqle stan with as many c lslers as there
'Lre
;cor.ls wlh each c lsierhavino on vone record
g) The sel of dala norma y used to b! dlhe cassl er modelis lermed as
h)-- provLdes an nionnauon-theorelic aPproach 10 measure lhe
goodness ofa sPlit
SECTION_B
Write shortnoles onany seven of the follow ngqleslions I \712-1a)
2. Wlraldoyou mean byihelerm Dataoube ?
SECTLON C
Answerany louroflhe io owingquestions 9"3=12)
12. Explaln aboul lhe coicept!al basic components ora m!ll dimensionaldala mods
13. Disiing uish betwee n DBI\,'lSand Data Mining
r4 Das. bp -/o. g .lPdrlJio. Alao,iln rne oiao -orinrno
r5 Descrlbethe Lrndenyirg pinciple behinclDBSCANclusiering algorilhm
16 whar are the arlvaniages and dsa{lvanlages oi decsion tree approach over
oiherc asslflcal on aPProa€hes ?
l/. Explain aboul any lwo clecision lree con slr!ction algo thrns
SECTION-D
Wr te an essay on any two oi the iollowing q lesuons. (2 <5=1 0)
r8. Briel y discr.rss abo!l var oLr s dala lrare ho!se backend processes
a) G€nelLcAlooilhm
b) NeuralNetworks
21. Wrile short notes on :
a) Pincer search Algoilhm
b) K'l\,4edodcluste nq a gor lhm