Save trees use e-Question Paper DOWNLOAD THIS FREE AT www.viuresource.com BGS SCHewe ow [TI LL | 1586 Sirth Semester BE, Degree Rxamalaation, Aug/Sept:2020 Data Mi ig and Data Warehousing ‘Times? hrs Max. 1 ® Note: Answer any FIVE full questions, choosing ONE falt question from eacRyuadile. What is «Data Warchouse? Discuss varons age end trends in dg (08 Marts) [Explain in detail the three ~ tier Data warehouse architecture, OR Discuss the concept of star, snowflake and galaxy sebggas fo Summarize the various OLAP operations inthe Identify the different indexing method ‘with brief explanation, (8 Marks) Differentiate ROLAP,, MOLAP and. (08 Maks) What is Data Mining? spin od ining tasks, with suitable examples. (08 Marks) Explain different steps in sing steps. Write any 3 challenges faced in Data Mining. (08 Marks) Moa What is Aprio iti used to find frequent item sols? Expl, (8 Mars) ust sing closed ffequent itemsets, with an example. Show the relations “1 -maximal frequent and closed frequent itemsets. (Mars) sth algorithm for discovering frequent itemsets. (os warts) bent ‘Objective Measures of Inerestingness for evaluating association pattems. (08 Maris) Classification. With a nest figure, explain the general approach for solving classification model, (08 ans) 10f2 Go green BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Vturesource Go Green initiativeSave trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.viuresource.com Consider the following data sot fora binary. TIT TT 6 T z oF FUT = FIT Z FF z Teli; = F[T/so[ Classiicaton problem |). Whats the entropy ofthis collection of training examples to the positive class? 48). What are the information gains ofy and ay relative aight examples? sil) Foray, which isa continuous attribute, compute nin for every possible split (8 Marks) salle lB oR : 8s What is a rule ~ based classifier? Explg ing algorithm in rule — based classifier (08 Marks) Write wa algorithm for K ~ Nearest Ne} classification. List the characteristics ‘of Neatest Neighbor classifiers. (08 Marks) 9 a, What is Cluster analysis? types ofclusters with examples. (08 Maks) 1b, Deseribe K~means cust a a are its limitations? (8 arts) oR 10 a, Discuss DBSCAN alg ering. (08 Mars) b. Explain Agglomsrative Hefischicel Clustering Algorithm, with different proximity between chusters. SS (Os Mavis) 2of2 BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Vturesource Go Green initiative