- -\i

National College of Engineering

(Talchhikhel, Lalitpur.)

DATAMINING
(Elective II)(CT 7 25 02)

4'n Year 1" Part

I
I

QUESTION COLLECTION
I
.,,-",.

TRIBI{UVAN UNIVERSITY Exam. llat'l<

INSTITUTE OF ENGINEERING Level BE Full Mrrkr 80

Programme BEX, BCT Marks 32

Examination Control Division Pass

2076 Ashwin Year / Part Iv/I Time 3 hrs.

.$Mss!: : Pffi"Mi* w {WItYs )-ffi?-f::m

Candidates are required to give their answers in their own words as far as Practicli]3t
i!:"'!,j
Attempt All questians, ":'.i
, "-i I
Thefigures in the margin indicate Full Marhs. i'H I
,,t.1_lr.J
Assume suitable data if necessary. * t,.'.'Jl
-
,4:

l. What are the fundamental differences between Data Mining and Data Warehousing?
Describe the steps of KDD for data mining. [3+71

2. 'What do yoir mean by dimensional data? What are base & apex cuboid? Slicing & Dicing?

Roll Down and Roll UP oporations? Give example. [2+3+3+3]

3. How do you measure the accuracy of classifiers? How do you select best root attribute in
decision tree? Explain' [4+61

4. What are prior and posterior probabilities? Explain the algorithmic steps of Bayesian
classifier and write its stengths. [3+7]
S. For the transactions given below, c,onsider confidencr60g6 and minimum'suppo*=30%.

Identi$ large itemsets (L-Itemset) at L=3 with possible associations using A-priori
algorithm and generate F-List using FP-Growth algorithm. t12l

Transactions Items description

T1 A,B,C,T,M,P,D,K
T2 A,B,T,P,D,K
T3 B,C,T,D,M,A,P
T4 A, C, T, M, D,
T5 A,C, D, K, M
T6 B,C,T

6. How DBSCAN algorithm works? How do we avoid the issues of DBSCAN? [8+2]
7, Explain web mining taxonomy. t8l
8. Write short notes on (&y-IUIS) [3+3+3I
a. Data smoothing techniques
b. Clustering and its application in anomaly detection
c. AprioriAll: Sequential pattem mining algorithm
o 26D ]'RIBHT}VAN UNI\IERSI'IY Ex:rm.
INSTITUTE OF ENGINEERING I,CVel BE Full Marks 80
Ilxamination Control Division Programme BCT,I]EX Pass N{arl<s
2075 Aslnvin Yc:rr / Ilart IV/I Tirne 3 hrs.

^lr.!r-jf
rl " P^ata
lrulinin g (Eteuirtc I) (cT72s02)
Candidates are required to give their ausrvers in their own
Attempt l!!questions.
The figures in the ntargin indicatc Full jl[arks.
Assume suitable data if neces$ary.-

1. I-lorv is data rvai'ehouse different

12+21
a
L^ Discuss issues to consider during operations on
OLAP with suitable example.
[5+5J
Explain Na'rVe Bayesian classification with suitable example.
A
rll
a. The confusion matrix for a classifier is given aS follows:
[10]
Predicted Class
Class 1 Class 2
Class I 2t 6
Actual Class A1
Class 2 +l
Calculate: Accuracy, S ensitivity, SpeCi fi city anA preci si on.
5. V/h1' astotiation analysis is required in data mining? Explain Apriori principle rvith
example. [2+6]

6. Whalt are the advantages of FP grorvth rnethod? Explain FP grorvth algorithm. 12+61
7. E>:plain I(-n:eatrs clustering u,itii Iirnitation. Generate two clusters from following dataset
using K-rneans clustering. 14+6)

A B
I )
2.5 4.5
4 6
3.5 .ti
4 5.5
J 6
o
6. What are outliers? Explain an algorithm that can be used to generate density based
clusters. t8l
9" Whi, s1r*moly detection is important? Explain distance based method for anamoly
detection. t2+61

10. Explain Web mining and Multimedia mining. t6l

tFi.*
'09

36 B TRIBHUVAN LINIVERSITY Exam. Back

INSTITUTE OF ENGINEERING Level BE FulI Marks 80
Examination Control Division Programme BEX, BCT PassMarks 32
2074 Ashwin Year / Part IV/I Time 3 hrs.

Subject: -DataMining (Elective 0 Qf72502)

'/ Candidates are required to give their answers in their own words as far as practicable.
'/ Attempt All questions.
'/ The figures in the margin indicate Full Marks.
y' Assume suitable data if necessary.

1. What is data mining? Explain the process of data mining. L2+31

2. In real-world data, tuples with missing values for same attributes are a cofllmon
occurrence. Describe various methods for handling this problern.
tsl
3. what is classification? Explain Rule-Based classification with its classifi cation principles
with suitable example. [2+8]
4. The confusion matrix for a classifier is given as follows:
[10]

Predicted Class
Class 1 Class 2
Class i 25 9
Actual Class
Class 2 4 31
Calculate:
a) Accuracy b) Sensitivity
c) Specificity d) Precision
5. Identify the candidate, frequent item sets and association rules for the following
transaction data using Apriori algorithm.
t8l
TID ITEMS
1 Ml, M2, M5
2 ]|d2,M4
a
J M2, M3
4 Ml, M2, M4
5 MI, M3
6 M2, M3
7 Ml, M3
8 M1, M2, M3, M5
9 M1, M2, M3
Take minimum support :2\Yo,minimum confidence 80oZ
6. Explain FP-Growth algorithm with example.
l8l
7. Write K -means al ithm and find clusters for following data set. [2+8]
Instance X Y
1 1.0 2.0
2 2.5 1.0
3 3.5 1.5
4 4.0 1.0
5 3.5 2.5
6 5.0 3.0
(Take K:2)
8. What is web mining? Explain different categories of web mining. t6]
9. List the various types of partition based clustering methods. Explain Hierarchical
clustering method with anexample. [10]
10. Write short notes on: (Any two) [2x4]
a) OLAP Operations
b) Density reachable and Density Connected
c) Data Mining for Anomy Detection
***
 ?68 I'IIII];iLJV.\N I-]NI\']IRSITY
ll! STITt j]'l:l 0F ENGIN LrllRNG
Iixamination Control Division
2874 Chaitra

Subject: -DataMining (Elective D Gr72502)

Candidates are required to give their answers in their own words as far as practicable.
Attempt All questions.
The figures in the ntargin indicate Full Murks.
Assume suitable data if nec.essary.

1. \\rhat is data u,arehouse and data mart? Describe Snowflake scheme with example. 12+41
2. What are the approaches to handle missing data? Describe OLAP and operations on
OLAP with suitable example. Differentiate between OLAP and OLTP. L2+s+31
3. Draw clear block diagram depicting different stages in classification. Explain the inverse
relation between precision and recall. Given the confusion matrix, determine accuracy,
sensitivity and precision of the classifier model. [2+3+s]

Predicted
Positive Negative
Actual

Positve 142 40

Negative 98 720

4. Explain decision tree with the concept of Naive base classification with appropriate
example. [10]
5. Why association analysis is required in data mining? Explain apriori principle with
example. l2-r6l
How does FP growth approach overcomes the disadvantages of Apriori algorithm. For the
transaction data given in table generate FP-Tree. [2+8]

Transaction ID Item set

TI Camera, Laptop, Pen drive
T2 Laptop. Pen drive
T3 Laptop, Mobile, Earphone
T4 Earphone, Mobile
T5 Camera, Earphone
T6 Laptop, Mobile, Earphone

7. Describe the difference between Hierarchical and partitioning clustering. How K-means
clustering is applied? Verifu using example. 12+81

8. What do you mean by anomaly detection and why is it important? Describe distance
based approaches for anomaly detection. [4+3]
9. Write short notes on: (any thlee) [3 x3]

i) Issues in clustering
ii) Multimedia mining
iii) Time series data mining
iv) Web mining
 378 'IRIT}HUVAN LINIVERSITY
Exam.
-NewBack Q066 & LaterBatch)
INSTITUTE OF ENCINEERiNG Level BE Full Marks 80
Examination Control Division Programme BE, BCT Pass Marks 32
2073 Shrawan Year / Part IV/I Time 3 hrs.

$ y "tj_g g (,,
_; D*aQ |-ra!n! og_ (Et e c t i v e I I) (C r 7 2 5 0 2)
'/ Candidates are required to give their answers in their own words as far as practicable.
'/ Attempt All qucstions.
( Thefigures in the margin indicate Full Marks.
./ Assume suitable data if necessary.

1. "The world is data rich but information is poor". Justify with your own words tg]
2. What are the measuring elements of data Quality? Explain different data transformation
by normalization methods with an example p+6j
3. What is a decision tree and how information gain is used for attribute selection? Explain
with example.
t8I
4. Explain Roc. Using the following dat4 calculate TpR, FpR, precision for given
confusion matrix.
[1+3+6]
A B
A 20 5
B i0 40

Classiff,A=Yes,B=No
5. What is FP Tree? How FP--gtowth algorithm eliminate the problem of Apriori algorithm?
Construct the FP tree and find association rules foi' the following transaction database
using FG- Growth algorithm. support = 3}yoand confide nce = 75o/i.
tt0l
Transaction ID Items
1 P.R.S
2 R,S,T
J P,Q,IT
4 P,R,S,T
5 P,S,T
6 P,Q,T
7 Q,S,T
8 Q,R,T
6. What are Categorical data? What are the possible issues,arriveg when
using Categorical

7 ' Whar is ilre application of clustering in data mining? Explain the

k-mea,s'algorithm with .
example.
t8l
8' What is anamoly detection? Explain distance based method for anamoly detection.
Ig]
9. Write shorl notes o{r;
i) Data rransformation ' [4x3]
ii) Web mining
iii) or,AP
'6)

36 B TRIBFIWAN U}{IVERSII'Y Exam.

'',:i-'r',:
':' , ,,','l ' :ngqu6fll.,J.:..": ,, .-,:,1,,,,.

INSTITUTE OF ENGINEEH"IhIG Level tsE Full Marks 80

Examnimatiom ContrCIl Ilivisiom Progrrmme BEX, BCT Pass tsIarks 32

l{}?3 Chaitra Year / Part ff/I "['ime i flrs

€:r!:P*}p!lpiog-{Fk:!-v"s"il{"-c:l-?!"0-2)
--!"'fi to give their answers in their own words as far as practiaable.
{ Candidates are required
r', ttempt AUquestions.
/ Thefigures in the margiw indicate fuil Mar$s.
{ Assume suitable data if necessary.
1. How is data warehouse different from RDBMS? Also list the similarities. l2+2i
2. What is data prs-processing? Explain data sampling and dimensionality reduction in data
pre-processing with su"itebl e exarnple. [2-F4+-.4]

3. F{r:rr,, data in must real apptrication becomes Asymmetric. Explain the difference bet'*-een
synrmetric and asymrnetric data. tsl
4. What is ID3 al thm? Caler.rlate'IPE. FFR arrrj Accuracy tbr given confusion tnatrix. 12+67
Fredicted r- Predicted -
Predicted + 100 40
Predicted - 60 300

5. Explain Apriori algorithm in market basket analysis? IJerive assoeiation rule frorn the
t"ollowing market basket transactions with 50% of minimun:. suppoc and confidence
)uutl v trl [3+?.1
Transaction Iterrsets
1 A.B.C
2 A,C
J A, r,
4 B.E.F
5. What is the use of FP-Grou{h method in market basket analysis? Expiain FP-Growt}r
nr.ethod with a suitable example. [1CI]

7. Horv clustering differ from classification? Given the one*dimensional points

{5, 12, 18,24, 3A, 42,48} with initial centroids {5, 12, 18}, create three clusters hy K-
Means algorithm and oalculate SSE for this clustering result. [4+8]
8. Exptain Sequential Fattern and Sub-graph Pattern with suitable exarnple. [4+4]
9. What is anomaly detection? Hxplain the issues associated with anomaly detection. L2+31

10. Write short notes on: (Any two) [2xa]

a) Tirne series data mining
b) Overfitting and ROC
c) wwwrnining
***
@

tN.e*r.
zic TRIBI{WA}.IUNIVERSITY Exam. Buct* (2d66 i&' l.at$f8titeh].,.-,
INSTITUTE OF ENGN{EERiNG Level BE Full Marks 80
Examination Control flivision Programme BEX, BCT Psss Marks 32

2072l(artik Year / Part ru/I Time 3 hrs.

J:tj:"!::gsYNtYUgl::lY:Ll-(W3!9
Candidates are required to gi're their answers in their owu words as far as practicable.
Attempt All questions.
rno is"Gin it,
margin indicate Futl Marks.
Assume suitable data dnecessary.

1. What is a datamining? Explain general steps in brief. t4l

Z. W-6y data preprocessing is required in the data mining? E.xplain some of approaches of
data clearing. [5+5J
3. Write about Hunt's Algorithm for Decision Tree induction Explain the test conditions
that can be used for different.attribute t)?es. {101-
4. Ehat is an Al'l}'i ciassifier? Expiain its general consideration that required for the
classifier. [2+6]
5. What is an association analysis? Explain its importaoce in ruarket-basket aoalysis. [2+s]
6. S&at is a Frequent item set? Explain FP growth metbod witb example. [1+8]
7, What is a cluster analysis? How it is differsrt from classification? [s]
8. Explain a DBSCAN algorithm with example. L7)
g. What is an Anomaly detection? Discuss its importance in secruify. lsI
10. Explain Time series data mining in brief. t6I
11. Write short notes on: [3x3]
i) Datatransfonrration
ii) Sequential Pattern
iii) Cluster evaluation
+**
 ! rii-. ir-t!

:is rRtiltitlvAN {,jNlvttl{.strY Exam"

iNSTi'rUTE t)F IlNGINI-itiRIhlG Level EE Full Marks 80

Programme BEX. BCT Pass Marks 3L

Exitnaim*tion Controtr Divisiom
2fi72 Cthaitra Year i Fsrt ry/l Tirne 3 hrs.

Subiect; - ilata Mining (cr72502)

./ Candidates are required tn give their answers in their own words as far as praeticable.
,/ Attempt All questions.
{ The.figures in the margin indit:ate F"utt Mqr$s,
,/ Assume suitable data if necesssry.

1. What is data mining? Explain ali the steps of knowiedge discovery. [2+6]
) How do you perform analysis of multidimensional data? Explain rn'ith the concept of
OLAP. t10l
J. Predict Ciass label using naive Bayesian classifier for X
: (age : youth,
ineorne: medium, student: Yos, credit-rating: fair) using the fullowing data set. t10l

RID Age Inct:me Sfudent Cred,it-ratins Clnss Buy connputer

i Youth F{ish I\ L) Fair hlo
2 Youth HiEh No Exeelient No
3 Middle-age Hieh No Fair' Yes
4 $enior Meciium No Fair Yes
'Fair Yes
5 Senio,r Law Yes
o Senior Lorv Yes Excellent I\O
r Middle-age Law Yes Exceiient Yes
I Youth Mediunl lic Fair T.Jo

I Youth Low Yes Fair Yes

1CI Senior Medium Yes Fair
l1 Youth l\4edium Yes Excelient Yes
12 Middle-age ivlediurn No Excellent Yes
l3 Middle-aee Hieh Yes Fair Yes
14 Senior |,{edium ]r{o Ey"cellent Nct

4. The confusion matrix for a classifier is given as follows: il 0I

ac**ual cl ass
c'1ass1 cl as s2
cl ass"L 2t A
predicted class
cl ass2 41

calcu'late a. accuracy
b. sens'itiv'itv
c . speci t'ici ty
d. preci sion
e. recal I
5. What is the importance ,:f SUPPOII.T and COI;iDEl'iCt--l durins assaciatir:n anatrysis?
Expla.in FP-Grcwth method rvith exarnple' l10l
6. What are the fypes r:f chisteling methods? Explain DBSCAi{ rnettrod cf clustering r,r'ilh
an example. [10]
What is the use ol Apriori Algcrithm in market basket ar:ralysis? llxplain with suitabie
exampie. t10l
8. Writs sh*rt notes on: [4x3]
i) f irne series Data mining
ii) Issues itr anomalyiF'raud eietection
iii) Categorical data and related issues
**f
 27C TRIBHUVAN UNIVERSITY Exam. New Back (o066 & Later Batch)
INSTITUTE OF ENGINEERING Level BE Full Marks 80
Examination Control Division Pass Marks 32
207l Shawan Year lPart IV/I Time 3 hrs.

Subject: -Data Mining Gr72502) (Elecrive I)

r' Candidates are required to give their answers in their own words as far as practicable.
,/ Attempt <4,11 questions.
,/ 44questions corry equal marks.
/ Assume suitable data if necessary.

l. What is data mining? Explain different data types of attributes in a dataset.

2. How can principle component analysis be used for dimentionality reduction?
3. Why is classification a super vised leaming method? Explain different impurity measures
used in decision tree classifier.
4. Explain Naive Bayes classifier. How can over fitting problem be solved in case of
classification?
5. Explain FP-growth algorithm in delail.
6. What are association rules? How can spriori algorithrn be used to generate association
rules.
7. What is contiguous cluster? Explain an algorithm that can be use,il to generate contiguous
clusters.
8. Explain K-means clustering with limitation Use k-means clustering to cluster the
following dataset.
A B
1.0 1.0
1.5 2.0
3.0 4.0
5.0 7.0
3.5 5.0
4.5 5.0
3.5 4.5
9. How can Nearest-Neighbor algorithm be used for anomaly defection?
10. Write short notes on:

a) Time-series data mining

b) Data warehouse and, data mart
{<**
 z.lc T'zuBltUVAN lj.I'ilvEi{SIIY Ex3y. ffi,r#rilFW
NSTITU'I'E OF EN(iI}{EIIRING BE
I:9I-91. .. ru! $Ia1hr
, i I 90
Examination Control Division
2071 Chaitra *ear/Part ltVlt lfimc i3

$ybjectt"; ; Ilqla M,iling (Elect ive I) t:'f7

1'
250 2)

C:atclidates are required to give titeir answers in their or.rn rvorcis ils lsl iis plar;ticable.
iltt empl All quesr ions.
,4!! iS ue s i i rtrrs c(t r ry e qzttt I m ir ks.
A,rsume suitu.blc tlara if necessol',1'.

t. What is a Data lvlirting'/ Expiain its; i:rpplici:iion.

2. Ilxplain the pronerties tirat a Distance Metric ne'eds to rtlp{)i.;rt rtith respect lir
Nlirrkorvsk i's dil;tturce.

.1. \Vhal is a decision tree? Explairr Girri index rvittt suitable exampie.
tl . I:xpiain a Bayes classifier. In rvhat cases can Naive Ba;-es and Fla,rc,sinn llelic['Nefivork
be used'J

5. \\/h), is ir clusterilrg an unsripervisecl iearnins? I-lc,i,r' carr hierarchical clusters be generated

usi ng Ilis ectin g Ii-means al-{r,rri tlulr ?

6. Ex p lain th e diffe rer,l oltiii;c u lt s cr i' c: I uster v e ! i d it-v'

"1
]lou,rjoes Apriori.{lg,orithgr oniirri;:e the bri.tte li:irce apir:'t.irri.:h ft:r ttcquent itr:rn set

p.c'ne ration?
8. What is ar1 /\nomaly Detcu"iilrr') I:rplain l'eu'distancg !35r:d approltl"tc:s that can ire uliei-l
ft rr Anotni:ly,Deti:ction.
 02C.i:: - i;,:TRIBHUVAN'UNtVe RSt't y -" lixam.
INSTITLJ'IE OF ENC] INL, L]I( N C [,eveI BIr Fyll N'larks BO

Iixamination Con trol f)ivision Progranr me BI1X, BCT Pass Marks )l

2070 r\shad xiriir.lrr t\/ / I rinr. lh rs.

S ubject - Data Mining (Etecrive I) (CTZ2s02)

Candidates are required to give their ansrvers in their or,vn.worcis,?s-far.,

Or^.,,..ile-
/ttempt All question.r
The figure s in the margin indicore Futl tl{a*s.
tlssume suitable data i,f necessor)1.

l. what is dirnensionalit-v reduction? why is it important in data mining?

tsl
2. What is the importance of hornoseneousness measure in decision tree classifier? lixplain
GINI index?
t8j
3. What are the properties of a distance metric? Hou, is clistance metric used in instance
based classifier?
ll0l
4. What are association rules? Explain its imporlance u,irh e xample.
t6l
5. Explain FP growth aigorithm in detail with example.
J2l
6. What'are density based clusters? Explain DBSCAN clustering algorithm with example. p0l
l. Explain different measures that can be used to compare trv6 gIu51sp5.
t6l
8. What is anomaly desertion? Explain likelihood approach for anomaly detection.
t8l
9. Explain seasonality in time series dara.
tsl
10. Write short notes on: l'5 +
t" 'l5l
a) OLAP cubes
b) Data ware house
' r\ (i
r:\:-lI I i I, I L r...,l L.\\lt.\L,ll,i{.i,\t l i.,eYCtI Dr. j tlulr i:"laIK.t :DV ;

!*/
\
' t^
' Iixarninatlon Contt'ol l)ivision []rugra nrrne ll[;\, I-]i- i' I'ass I{a rl<-s
ii
2070 Cliailra i"rirfoil , r(r i t 1-irne ,lhrs. i

(c7-725)

Candid.ates are requirecl to give tlrcir answers in tlreir owu rvords as fur as practicable.
Attempt Ail ques'tions
Theftgttres in the margitz indicuta I;ull lVhrks
Assunte suitable datct if nccessur.l,

1. a) What is "curve of Dinrcnsionality""? l{oiv can it L',e avoided? t5l

b) Discuss the impact of noisy.deta in cletta nlirring'? t5l
2. Explain rule based classitlcr'f llorv can (lN2 r\lgcrritlurr Lre used for ntle based
classification'i L)efine "Aocurac1r" iurd "Laplucc" ffIeasures used for rule evaluation. tel
3. An input sequence."A.A'B Il B A ;\ A !, [" rr'as used lor classihoation. Thc Classifier
'X' predic,ted the seqLrences as: "A A ll ll U A A A B B" where as the Classif-ter
) 'Y'predicted the sequeltccs as: "A A A A B B A A A []". Develop the corresponding
corifusion matrix for the classificrs an<J fincl their corresponding. [10]
i) Accuracy
ii) Precision
iii) True f'ositive Rate
iv) False Positive Itatc
A
$- Explain Apriori algorithm. L.lsc ApLiori to gcncratc ficquent item sets with support of
50% for thl toltor.ving ttansitctiort ciatabase, [10]
IrD Items
I ACD
2 BD
3 ABCE
4 BDIT

) 5. Why is pattern evaluation important in association rule mining? Explain with example the
statistical based measures used lor nreasuring interestingness of association rules. t8l
6. What. is a density based cluster. Explain zur algorithm that can be used to generate density
based clusters. t8I
7. What is Hierarchical Clustering? Differentiate between agglomerative and divisive ,:4
i;;*
approach of hierarchical clustering, Augment your answer r,vith appropriate illustrative
examples. l10l
,,:ij.,l
0
o. Write short notcs on: tl sl .,:,t

i) Data u,are housr' atrcl l)ata mart

ii)-Basc Rate Fallacy
iii) \\/eb mining
iv) A:romaly Detection
v) Convex Hull Method
*,1. +
 IRIBIILIVArN tiN IV FlI{Sfi 'Y
INST'IT'UTE OF ENGINEERING
Examination Control Division
2069 Chaitra

siijii,-- D;i; Miiiiis iir,,,,ii',il 11

'/ Candidates are required to give their answers in their own words as far as practicable,
{ Atrcrytt All questiotrs.
'/ T'he figures in the nzargitt indicate F'ull Mafis.
{ lssume suitable dara if'neces.rory.
(-L hw.-
.u,{ Wnat are the different data types? Explain with examples.
l5l
I{ow is dsg.ignlE classifier diff'erent tha, url.e-ba$Frl crassifier?
rsT)
Explain Baye's Theoreyr. Horv can it be used for classification? Explain how Naive 1
Baye's simplilier the cornputational complexity of Baye's classification algorithm. 121 \
\/K What is frequent item set mining? Ilow clo Apriori and FP-grou.th algorithm optimize the _-)
brute force approach for finding frequent item sets?
[1s]
,-*4"plain K-means elirstering algorithm with examples.
j ti0lifi
the issues regarding cluster validation.
;|--Wptain t6t_)
7. What is Base Rate frallac-v? Explain r.vith example.
l7)
t$"/ How can-Apriori Alg.rithm be used lbr finding associalion rules crut of a frequent item
l- JufnLlr
-r+9
J!t. ,.,r,,iqn(e
t7l
9. Write short notes on: [s+s]
gat'Page RanJ<

,prDatama*