Total No. of Questions : 4] SEAT No.

:
PA-10126

5
[Total No. of Pages : 2

6 11
[6009]-432

4:2
T.E. (Artificial Intelligence and Machine Learning) (Insem)

2:1
4/2 71
31
DATA MINING & WAREHOUSING

3
02
5 0 11
(2019 Pattern) (Semester - II) (318553)
0
5/0
Time : 1 Hour] [Max. Marks : 30
.14 GP

Instructions to the candidates :

CE
5.6

1) Answer Q.1 or Q.2, Q.3 or Q.4.

2) Neat diagrams must be drawn wherever necessary.

15
3) Figures to the right indicate full marks.

61
13

4) Assume suitable data if necessary.

5.1

4:2
11

2:1
71
Q1) a) What is KDD? Explain about data mining as a step in the process of
31
knowledge discovery with neat diagram. [5]
13
02

b) Explain Data pre-processing in data mining in detail? [5]

4/2
01

c) What is Apriori Algorithm? How does the Apriori Algorithm work in data
5/0
GP

mining? [5]
50

OR
CE
5.6

Q2) a) A data set has five transaction min support 60% and min confidence 80%
.14

15
[6] 61
13

Tid Item bought

5.1

4:2

T1 MONKEY
11

2:1
71

T2 DONKEY
31

T3 MAK E
13
02

T4 MUCKY
4/2
01

T5 COOKIE
5/0
.14 GP

i) Find all Frequent item set using Apriori Algorithm

50
CE

ii) Find all Association rule using Apriori Algorithm

5.6

b) Write a short note on Text mining & Web Mining? [5]

c) Describe about Major issues in Data mining? [4]
13
5.1

P.T.O.
11
Q3) a) How does the Naïve Bayesian classification works? Explain in detail.
Naïve Bayesian classification----Explanation. [5]

5
11
b) Explain decision tree induction algorithm for classifying data tuples with

6
suitable example? [5]

4:2
c) Write a note attribute selection measures? [5]

2:1
4/2 71
OR

31
3
02
Q4) a) Write and explain about Classification by Back propagation Algorithm?[5]
5 0 11
b) Explain mining multilevel Association rule in detail? [5]
0
5/0
.14 GP

c) Write a note SVM? [5]

CE
5.6



15
61
13
5.1

4:2
11

2:1
71
31
13
02
4/2
01
5/0
GP
50
CE
5.6
.14

15
61
13
5.1

4:2
11

2:1
71
31
13
02
4/2
01
5/0
.14 GP
50
CE
5.6
13
5.1
11

[6009]-432 2