Save trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.viuresource.com GBS ScHEHE Os 15CS73 Seventh Semester B-E. Degree Examination, Aug./Sept.2020 Machine Learning ime: 3 hrs Max. Marks {0 Note: Answer any FIVE full questions, choosing ONE full question from each modale. Module-1 orem perspectives and issues in, 1 What is Machine Learning? Expl Marks) 1b. Explain the steps in designing a learning system, fark) oR 2 a Describe the Candidate-Elimination algorithm. Explain its waghiN@ taking)fhe enjoy sport ‘concept and traning instances given below: Example | Sky [ Air | Humidity | Wind | WA@p] Forecast | Enjoy Temp sport T | Sunny | Warm | Nonna ime | Yes 2 | Sunny | Warm [High Same | Ves 3 | Rainy | Clod [High ‘Change | _No | Sonny | Warm [Tigh ‘Change | Ves Marks) b. Explain how to model inductive systems! nt deductive systems for Candidate-Elimination Algorithm, (06 Marks) 3. a Explain the concepts of entropy and ination in, (06 Marks) 1b. _Desoribe the IDB algorithm for, (oAlFaing. (0 Marks) 4a. Apply 1D3 algorithm for sion tree forthe following training example Temporaturo | Humidity [| Wind | Play Tennis Hot High [Weak [No Hot High [Strong | No Hot High | Weak | Yes Mild Tigh [Weak | Yes ‘Cool | Normal_| Weak [ Yes. ‘Cool | Normal_[Strong | No. ‘Cool__| Normal [Strong | Yes Mite High | Weak [| No. ‘Cool_|_ Normal] Weak |_Yes DIO ‘Mild—[ Normal Weak | Yes | DU] Sunny—[ Mid "Normal [Strong [Yes DI2 [Overcast | Mile Tigh [Strong | Yes D1 [Overcast | Hot | Normal_| Weak | Yes Dia] Rain [Mite Tigh [Strong [No (10 Marks) >. Explain the issues in decision tree learning, (06 Marks) Lof2 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 15C873 Module-3 5 & Explain appropriate problems for Néural Network Learning with ts characteristics ‘a0 Marky b. Explain the single perceptron with is learning algorithm. or 6 Explain Back Propagation algorithm. >. Explain the remarks of Back propagation algorithm, Modute-4 7 a Explain Naive Bayes classifier. Explain Bayesian Belief Neworks, Marks) OR 8 Explain EM algorithm. (08 Marks) Explain the derivation of K-means algorithm, {08 Marks) Module-§ 9 a. Explain K-nearest neighhor learning algorithm with exai (10 Marks) '. Explain case based reasoning with example, {06 Marks) 10 Write short note on: learning Radial basis fimetion Tally cighodreposbn . a yD as sak ees 2of2 BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Vturesource Go Green initiative