BE / gern Wor J tom /cBse [Ele machine Aearning Q.P. Code: 25539 . 3 pov} L))- Time: 3 Hours . farks: 80 NB: 1. Question No.1 is compulsory. i 2. Attempt any Three questions out of remaining Five questions. cr 3. Figures to the right indicate full marks. pe 4. Assume any suitable data wherever required but justify the same. Lo Q1 2) _ Explain the key terminologies of Support Vector Machine. {5 b) What are the key tasks of Machine Learning? 6 Nets ©) Explain the concepts behind Linear Regression. Ke sss 4) _ Explain in brief elements of Reinforcement Learning. 5 Q2 a) Explain the steps required for selecting the right machine learning 8 algorithm. oa ») For the given data determine the entropy after ¢lassification using each 12 attribute for classification separately and find decision attribute for the root by finding information gain with respect to entropy of Temperature as reference attribute. Sr.No. | Temperature | Wind | Humidity 7 Hot ‘Weak [Normal 2 Hot rong | Aigh : 3 Mild ‘Weak _| Normal =| 4 Mild ‘Surong [High [cesta Nir 6 Surongi[ Normal 7 Mild [Weak [High z Hot Strong | Nonmal 3 Mild Strong. [ Normal 10] Coot Sirong_[ Normal Q3 a) Apply k-means algorithm on given data for k=2, Use Ci(2, 4) & Cx(6,3) 10 as initial cluster centres. Data: a(2, 4), b(, 3), (5, 5), d(6, 3), e(4, 3), 6, 6) b) EXplain’¢lassification using Bayesian Belief Network with an example. 10 Define Support vector machine (SVM) and further explain the 10 ‘maximum margin linear separators concept. ? Explain in detail Principal Component Analysis for Dimension 10 Reduction. Explain reinforcement learning in detail along with the various elements 10 involved in forming the concept. Also define what is meant by partially observable state. Page 1 of 2 : 9CO38EE614896FSB498AFEDS187839BE.Apply Agglomerative clustering algorithm on given data‘at dendogram. Show three clusters with its allocated poi link method. $ Adjacency Matrix: =e fale fo]» Write detail notes Hierarchical Clu 20 Page 2 of 2 9C038EE614896FSB498AFEDS187839BE 2