1

Code: R7410503 IV B. Tech I Semester (R07) Regular & Supplementary Examinations, November/December 2011 DATA WAREHOUSING & DATA MINING (Computer Science & Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE questions All questions carry equal marks ***** 1 (a) Discuss the data mining systems classification. (b) What is the need for data preprocessing? Discuss briefly various forms of data preprocessing. (a) Differentiate between operational database systems and data warehouses. (b) Explain the efficient data cube computation with an example. Explain the five data mining primitives in detail. Quote suitable examples. (a) Discuss in detail analytical characterization. (b) Explain the graphic displays of basic descriptive data summaries. A database has six transactions. Let min-sup = 50% and min-conf = 75%. List of items 11,13,15,17 11,15,16,17 16,17 12,13,16,17 18,11,16 12,15,18

3 4

001 002 003 004 005 006

(a) Find all frequent item sets using Apriori algorithm. (b) List all the strong association rules. 6 What is classification? How classification is performed using decision tree induction? Explain with an example. (a) How to compute the dissimilarity between the objects described by categorical, ordinal and ratio-scaled variables? (b) Describe Chameleon algorithm used for clustering. (a) Explain mining complex data objects. (b) Discuss similarity search in multimedia data.

*****

2
Code: R7410503 IV B. Tech I Semester (R07) Regular & Supplementary Examinations, November/December 2011 DATA WAREHOUSING & DATA MINING (Computer Science & Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE questions All questions carry equal marks ***** 1 (a) (b) (a) (b) What is data mining? Explain the knowledge discovery process on data bases. Discuss the various methods for data normalization. Make a comparison between OLTP and OLAP systems. Discuss the OLAP operations used in multi dimensional data model. Explain in detail the architectures of data mining systems. (a) (b) What is concept description? Explain the attribute oriented induction algorithm. Explain the methods used to find attribute relevance. A database has six transactions. Let min-sup = 50% and min-conf = 75%. TID List of items 001 Milk, dal, sugar, bread 002 Dal, sugar, wheat, jam 003 Milk. bread, curd, paneer 004 Wheat, paneer, dal, sugar 005 Milk, paneer, bread 006 Wheat, dal, paneer, bread Find all frequent item sets using FP-growth algorithm. List all the strong association rules. With an example data set explain classification using Bayesian belief networks. Discuss the process of training the networks. (a) (b) Discuss the distance measures used to find the similarity between the numerical data items. Explain K-means algorithm. Discuss the merits and demerits of partitional based algorithms. Describe the various data mining functionalities that can be applied on spatial databases. Discuss suitable examples. *****

3 4

(a) (b) 6

3
Code: R7410503 IV B. Tech I Semester (R07) Regular & Supplementary Examinations, November/December 2011 DATA WAREHOUSING & DATA MINING (Computer Science & Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE questions All questions carry equal marks ***** 1 (a) (b) (a) (b) Briefly describe the data mining functionalities. Discuss the important issues to be considered during data integration. Explain the various schemas used for data warehouse. Discuss the types of OLAP servers with their merits and demerits. What is DMQL? Write the DMQL syntax for the data mining primitives. (a) (b) (a) (b) (a) (b) (c) Write about mining class comparisons. Explain quantitative characteristic rules, discriminating rules and description rules. Describe in detail association rule clustering systems. Discuss the techniques used to improve the efficiency of apriori algorithm. Discuss genetic algorithms. Give a note on lazy learners. How to measure the classifier accuracy? What are outliers? Discuss the methods adopted for outlier detection. (a) (b) Explain latent semantic indexing. Write a note on HITS algorithm. *****

3 4

7 8

4
Code: R7410503 IV B. Tech I Semester (R07) Regular & Supplementary Examinations, November/December 2011 DATA WAREHOUSING & DATA MINING (Computer Science & Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE questions All questions carry equal marks ***** 1 (a) (b) (a) (b) (a) (b) (a) (b) (a) (b) (a) (b) (a) (b) Describe the major issues in data mining. Explain the data discretization techniques. Define data warehouse and discuss its applications. Explain the implementation of data warehouse. Explain designing GUI based on DMQL. Give a detail note on concept hierarchy primitive in data mining. Explain about data generalization based characterization. How to measure the dispersion of the data? Explain with examples. What is constraint based association mining? Explain. Discuss different types of association rules. What is a neural network? How these are used for classifying the data? Explain. Explain linear, multiple regressions used for prediction. Discuss DBSCAN clustering algorithm. Explain AGNES and DIANA hierarchical clustering algorithms. Explain the features of world wide web and discuss in detail various data mining functionalities applicable to web. *****