TEST-1 1. Define each of the following data mining functionalities: Association, Classification, Prediction, Clustering, Regression and Summarization.

Give examples of each data mining functionality, using a real life familiar database. [15] 2. a) Explain the process of data cleaning in data preprocessing techniques. b) Describe the five primitives required for specifying a data mining task. [7+8] 3. Briefly outline how to compute the dissimilarity between objects described by the following types of variables: i) Intervalscaled variables ii) Asymmetric binary variables iii) Categorical variables iv) Ratio-scaled variables. 4 .With the neat sketch, discuss the architecture of data mining system and also specify, how data mining is related in the process of knowledge discovery. [15] 5. a) With a neat diagram, give a brief explanation of the various components of a data warehouse architecture. b) Discuss about the typical OLAP operations on multidimensional data with an example. [15]
6. (A) Explain the design and construction process of data warehouses. (b) Explain the architecture of a typical data mining system. [8+8]

7. (a) Brief discuss about data integration.

(b) Brief discuss about data transformation. [8+8] 8. Brief compares the following concepts. Use an example to explain your Points.

9. (A) Snowpack schema, fact constellation, starlet query model. (b) Data cleaning, data transformation, refresh. (c) Discovery driven cube, multifeature cube, and virtual warehouse 10 .Explain the syntax for the following data mining primitives: (a) Task-relevant data (b) The kind of knowledge to be mined (c) Interestingness measures (d) Presentation and visualization of discovered patterns. 11. a) What kind of patterns can be mined? Explain.
b) How can you go about filling in the mining values for attributes? Explain Noisy data with example. (8+8) 12. Explain the density based clustering method in detail with an example

13.Discuss Apriori algorithm with suitable example and explain how Efficiency can be improved. 14. A) Consider the following small data set with six transactions, containing itemsets made of items a to e.

its

Using the Apriori algorithm, give all candidates and all frequent item sets of lengths 1, 2 and 3 with a minimum support of 2 transactions. For all frequent item sets of length three, generate all association rules with b) Discuss on the various classification of association rules with an Example for

15. (a) Brief discuss the data smoothing techniques.

(b) Explain about concept hierarchy generation for categorical data. [8+8]

16. .(a) Discuss distance based outlier detection

(b) Explain OPTICS algorithm for clustering.

(c) Explain the categorization of clustering methods

17. (a) Discuss in detail OPTICS algorithm. (b) Explain the categorization of clustering methods 18. Write FP-growth algorithm for discovering frequent itemsets without Candidate generation. Explain with example. [16] 19.(a) Brief discuss the Discretization and concept hierarchy techniques[16] (b) Give a detail note on CLIQUE algorithm. 20. a) What kind of patterns can be mined? Explain.
b) How can you go about filling in the mining values for attributes? Explain Noisy datawith example. (8+8) 21.

a) Describe the various issues in data mining systems.

b) Suppose that the data for analysis includes the attribute Marks in Percentage. The Mark values for the data tuples are (in decreasing order) 99, 96, 96, 96, 95, 95, 85, 85, 82, 82, 81, 80, 80, 80, 76, 76, 75, 75, 75, 73, 73,70, 66, 65, 60, 52, 52 are given below, answer the following. Use smoothing by bin means to smooth the above data, using a bin depth of 3. Illustrate your steps. Comment on the effect of this technique for the given data. Also specify other methods available for data smoothing. 22.Explain the density based clustering method in detail with an example