——————— Q.P, Code : 724303 (3 Hours) Marks; (#0) NB : (1) Question No, 1 is Compulsory, (2) Attempt any Three questions out of the remaining Five questions, £ (3) Figures to the right indicate full marks, Ox (4) Assume any suitable data wherever required, but justify the same. Cs 1) (a) What are the issues in Machine Learning? hz of (05) (0) Explain Regression line, Scatter plot, Error in prediction and Beswfitt 1c. (05) (©) Describe the essential steps of K-means atgorithm for clustering) analysis, (03) (@ What is SVM? Explain the following terms: hyperplane, hyperplane, margin and support vectors with suitable example, J (05) 2) (a) Explain in detail Temporal Ditference Learning, MS (08) (b) Create a decision tree for the attribute “class'y-usirigthe respective values: (12)Q.P. Code : 724303. 5) (a) What are the different Hidden Markov Models? (b) What is Reinforcement Learning? Explain with the help of an examy 4) (@) Apply K-means algorithm on given data for k~3. Use Ci(2) ets) ead C. G8) as initial cluster ( Date: 2, 4, 6, 3, 31,.12,15,16, 38, 35, 14, 21, 23, 25, 30 ¢ ® - Ky ‘ (b) E> olain with suitable example the advantages of Bayesiar appréach over classical (10) approaches to probability. > 5)/@) Explain in detail Principal Component Analysis tr ee nae (10) (6) Find optimal hyperplane for the data points: ("jy (10) (G1), (2,1), G-D, G1), 4.0), 60, 6. 6, , =’ 6) Write Short Notes on the following: . ms 2 Machine eee sprig ns) s * b. (20)