Scribd
Upload
47 views3 pages

End Sem

This document summarizes an end semester exam for a course on data warehousing and data mining. It provides 8 questions covering topics like text mining, decision trees, clustering, association rule mining, and frequent itemset mining. Students are instructed to answer any 2 out of the first 3 questions and any 4 of the remaining questions.

Uploaded by

Sathiya Jothi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
47 views3 pages

End Sem

This document summarizes an end semester exam for a course on data warehousing and data mining. It provides 8 questions covering topics like text mining, decision trees, clustering, association rule mining, and frequent itemset mining. Students are instructed to answer any 2 out of the first 3 questions and any 4 of the remaining questions.

Uploaded by

Sathiya Jothi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

End Semester Exam Course Id: 406035 Data Warehousing and Data Mining Date: November 19th, 2003.

Total Time: 3 Hours


Max. Marks: 100

Answer any two questions from 1-3 and any four from the rest. Clearly state any reasonable assumptions you make. 1. (a) In a text mining application, 20 documents are retrieved for a given query. 7 of the retrieved documents are relevant. The total number of relevant documents in the database is 30. When 30 documents are retrieved for the same query, 10 are found to be relevant. Plot the recall Vs. precision for this text retrieval system. (b) A classifier is tested with a number of test data. The classifier output and the correct class are shown below. Draw the confusion matrix for the classifier. Srl No. 1 2 3 4 5 6 7 8 9 Classifier Output C1 C1 C1 C2 C2 C2 C3 C3 C3 Correct Class C2 C1 C3 C2 C2 C2 C1 C1 C1 [5+5=10] 2. What are semi-additive and non-additive facts? Given one example of each type. Give one example each of distributive, algebraic and holistic measures. [5X2=10] 3. Suppose that a data warehouse contains three dimensions date, doctor and patient. There is only measure charge where charge is the fee that a doctor charges to a patient for a visit. Design a star schema for the data warehouse, assuming some concept hierarchy for each dimension. Starting with the base cuboid [date, doctor, patient], which sequence of OLAP operations do you need to list the total fee collected by each doctor in the year 2002? [8+2=10]

1/3

End Semester Exam Course Id: 406035 Data Warehousing and Data Mining 4. Build a Decision Tree using the training data in the table given below. Divide the Height attribute into ranges as follows: (0,1.6], (1.6,1.7], (1.7, 1.8], (1.8, 1.9], (1.9, 2.0], (2.0, 5.0] [20] Gender F M F F F M F M M M F M F F F Height 1.6 m 2m 1.9 m 1.88 m 1.7 m 1.85 m 1.6 m 1.7 m 2.2 m 2.1 m 1.8 m 1.95 m 1.9 m 1.8 m 1.75 m Class Short Tall Medium Medium Short Medium Short Short Tall Tall Medium Medium Medium Medium Medium

5. There are 5 documents in a text database A, B, C, D and E. The inter document distance matrix is shown in the form of the following table. Using an agglomerative hierarchical clustering algorithm, build and draw the dendrogram. You should use a step of 0.5. [20] Document A B C D E A 0 1 2 2 3 B 1 0 2 4 3 C 2 2 0 1 5 D 2 4 1 0 3 E 3 3 5 3 0

6. There are two clusters C1 and C2 formed from a dataset. The Clustering Feature (CF) vectors of these two clusters are: CF1 = (2, 8, 18) and CF2 = (3, 6, 14). Determine the following: Centroids of C1 and C2 Radii of C1 and C2 Diameters of C1 and C2 Average inter-cluster distance between C1 and C2 defined as: 1 j (O i O j ) 2 n 1 n 2 iC1 C 2 [4X5=20] {If the values become complex, work out till the last step and leave it there} a) b) c) d)

2/3

End Semester Exam Course Id: 406035 Data Warehousing and Data Mining 7. Consider the 5 transactions given below. If minimum support is 30% and minimum confidence is 80%, determine the frequent itemsets and association rules using the a priori algorithm. [15+5=20] Transaction T1 T2 T3 T4 T5 Items Bread, Jelly, Butter Bread, Butter Bread, Milk, Butter Coke, Bread Coke, Milk

8. Consider the following table of transactions. Each row represents a transaction and each column represents an item. If an item is present in a transaction, it is marked as 1, else it is marked as 0. Determine the Frequent Itemsets using the Dynamic Itemset Counting algorithm. Use intervals of 5 transactions and min_support = 20%. [20] A1 A2 A3 A4 A5 A6 A7 A8 A9 1 0 0 0 1 1 0 1 0 0 1 0 1 0 0 0 1 0 0 0 0 1 1 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 1 1 1 0 0 0 0 0 0 1 0 0 0 1 1 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1 0 0 0 0 1 0 1 0 1 0 0 0 0 0 0 1 1 0 1 0 0 1 0 1 0 1 1 0 0 1 0 1 0 1 0 1 0 0 0 1 1 0 0 0 0 0 1

3/3

You might also like