POKHARA UNIVERSITY

Subject : Data Warehousing and Data Mining Time : 3 hrs 5. Discuss and justify that the objective of clustering is to increase the inter-
Year : 2018 Semester : Spring F.M. : 100 cluster distance among the clusters by reducing the intra-cluster distance at
Prog : BE IT/SE/CE/Elx P.M. : 45 the same time.
Answer ALL questions. All questions carry equal marks. Partition the given data objects into k Clusters using k-Medoids algorithm.
6.
[ Given k = 2 ]
1. Give a formal definition to Data Warehouse and explain the terms “Subject-oriented”,
Data A1 A2
“Non-Volatile”, “Time-varying” and ‘Integrated” used in the definition.
1 7 6
2. Draw the base cube, the apex cube and the lattice of cuboid from the given data. 2 2 6
. 3 3 8
4 8 5
5 7 4
6 4 7
7 6 2
8 7 3
9 6 4
10 3 4
Give an example of creating rules for making decisions by using the
7.
Decision Tree method
8. Use Gini Index to find out the order of Splitting attributes.
[ Categorization: (Temp : Upto and above 70 F) ; (Humidity : Upto
and above 75 % )]

Outlook Temp (F) Humid (%) Windy

3. Explain how support and confidence help in finding an association rule of items in
Sunny 79 90 T
market basket system.
Sunny 56 70 F
4. Construct an FP-Growth Tree from the data given below.. Sunny 79 75 T
[ .Given, No. of transactions (|T|) = 10 ; support (s) = 40% ; confidence (c) = 50% ] Sunny 60 90 T
Overcast 88 88 F
A1 A2 A3 A4 A5 A6 A7 A8 A9 Overcast 63 75 T
1 1 1 0 1 1 1 1 0 Overcast 88 95 F
0 1 0 1 0 0 0 1 0 Rain 78 60 F
0 0 0 1 1 0 1 0 0 Rain 66 70 F
0 1 1 0 0 1 1 0 1 Rain 68 60 T
0 0 1 0 1 0 1 1 0
9. Explain the differences between DBMS and DW with relevant
0 1 1 0 1 0 1 0 0
0 0 0 0 1 1 0 1 0 examples.
0 1 0 1 0 1 1 0 0 10. Discuss various steps of KDD with necessary diagrams.
1 1 1 0 1 0 1 0 0
0 1 1 0 0 0 1 1 1