Code No. 5261 /N/ MP FACULTY OF ENGINEERING B.E. 4/4 (CSE) II-Semester (New)(Make-up) Examination, August 2012 Subject : Data Mining Time : 3 Hours Max. Marks: 75 Note: Answer all questions of Part ~ A. Answer any five questions from Part-B PART —A (25 Marks) 1 Distinguish KDD and Data Mining. (2) 2. List the differences between OLAP & OLTP. Q) 3. Whatis Binning? Q) 4, List various OLAP operations in multidimensional data models. @) 5. Define Regression and Log linear models (2) 6. Why Bayesian classification is called naive? (3) 7. Define concept hierarchy with an example. @) 8. Differentiate classification and prediction. ro) 9. Draw Boxplots that are used for measuring dispersion of data (@) 10. Define : @) (a) loose coupling (b) semi tight coupling (0) tight coupling data mining systems PART —B (50 Marks) 11.(a) Explain three-tier data warehouse architecture. (5) (b) Explain various techniques used in data integration and transformation. (5) 12.(a) List and describe five primitives for specifying a data mining task. 6) (b) Explain Attributes Oriented Induction (AO!) approach to data generalization.(5) 13.(a) Explain Apriori algorithm, @) (b) Draw FP-Tree for the following transactional database and find frequent item sets with min_sup=2, _ ” TID | items T100| TTT. _| T200[ Tol, 7300 |" Tats T400| Ta l2ta T500| 14.13 T600| Tats Tuts Ty lat 14, Explain the process of classification using Back propagation method. (10) 15. Explain the following density based clustering algorithms. (10) (a)DBSCAN — (b) OPTICS 16.(a) Explain mining quantitative association rules. 3) (b) Write methods to mine multilevel association rules. @) (©) Explain the following multidimensional data models. (4) ()) Star schema (ii) snow flake schema (ii) fact constellation 17. Write short notes on any two of the following (10) (a) Mining text databases