The document outlines a data warehousing and data mining exam containing 4 questions. Question 1 asks about dimension modeling and cube hierarchies. Question 2 involves generating association rules using the Apriori algorithm. Question 3 differentiates between clustering concepts and performs k-means clustering. Question 4 covers partitioning around medoids and using information gain for attribute splitting.
The document outlines a data warehousing and data mining exam containing 4 questions. Question 1 asks about dimension modeling and cube hierarchies. Question 2 involves generating association rules using the Apriori algorithm. Question 3 differentiates between clustering concepts and performs k-means clustering. Question 4 covers partitioning around medoids and using information gain for attribute splitting.
The document outlines a data warehousing and data mining exam containing 4 questions. Question 1 asks about dimension modeling and cube hierarchies. Question 2 involves generating association rules using the Apriori algorithm. Question 3 differentiates between clustering concepts and performs k-means clustering. Question 4 covers partitioning around medoids and using information gain for attribute splitting.
Subject : Data Warehousing and Data Mining Time : 2 hrs
Year : 2018 Sem : Spring F.M. : 60 Prog : BE IT/SE/CE/Elx P.M. : 30 Answer ALL questions. All questions carry equal (5+10) marks.
1.(a) Write short notes on 3.(a) Differentiate between
(1) Dimension (2) Apex cuboid (1) Intra and Inter cluster distance (2) Sparse and Dense cluster (b) Draw a detailed Dimension modelling including each dimension from the given data. (b) Partition the given data objects into k Clusters using k-Means algorithm. [ Given k = 2 ] Data A1 A2 1 7 6 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 (a) Write short notes on 4. (1) Partitioning Around Medoids 2.(a) Write short notes on (2) Hierarchical clustering (1) Support (2) Confidence (b) Use Information Gain to find out the order of Splitting attributes. (b) Generate Association rules using A-priori algorithm. [ Categorization: (Temp : Upto and above 70 F) ; (Humidity : Upto [ Given, No. of transactions (|T|) = 10 ; support (s) = 40% ; confidence (c) = 50% ] and above 75 % )]