JAYPEE UNIVERSITY OF INFORMATION TECHNOLOGY, WAKNAGHAT ‘TEST -3 EXAMINATION: May, 2022 B.Tech. (CSE, IT) VI Semester COURSE CODE: 18BIWCI634 (2) MAX. MARKS: 35 COURSE NAME: Machine Leaming COURSE INSTRUCTORS: Dr. Ekta Gandotra, Dr. Vipul Sharma, Dr. Shabham Goel ‘Note: All questions are compulsory. Marks are indicated against each questions brackets. MAX. fiNMp: 2 Hrs vag QL. a. Give geometric intuition behind gradient descent ote ‘What will happen if leaming rate is too high or too low? », What is vanishing gradient problem? Which ac we te can be used to solve this problem? QZ. a. Consider the following 8 data points ny we locations, Use k- means clustering algorithm to moa ce clusters, A1(2, 10), A2(2, 5), A3(8, 4), Ad ), A6(6, 4), A7(1, 2), A8(4, 9) Note: Consider the initial clust« Koes and A7. The distance function between two data = paul b = (22, y2) is defined as: (a, b) = [x2~ xl] + 2 b. What is a dendpo SA ica clustering? How to get the optimal nimber ofc rogram? a Dis 9 Gr grctntc Algorithms with the help of a diagram and give of each step. en Linear Regression and Logistic Regression. jee between hard and soft SVM using geometric interpretation. “objective function for soft SVM and also explain how to optimize it. ‘the data distribution in the following figures. Which case provides the “4, tgjhimum entropy and why? S PTO 5] 2] [5] {2} [5] 2) §) 2)QS. a. Consider the following diagram of a single artificial neuron, The node has three [5] inputs x = (xl, x2, x3) that receive only binary signals (either 0 or 1). % ws tn my y= (v) ES Suppose that the weights corresponding to the three inputs have the , w2=—4 and w3 = 1 and the activation of the unit is given step-function: 1 ify>0 PO =4 0 otherwise Calculate the output value y of the unit for each gf thg*t input patterns, Pattern | Pi_[P2~ xt i | 0 i ott ot 0 i Given the following trai ingexafpp| thon the questionnaires survey (to ask 9} people opinion) with two ‘aipriBujes.(abid durability and strength) to classify whether a special paper ti a or not. Find the class of the test sample using k-NN algorithm A 3. Use L2 Norm for distance computations. X2= Strength Y= (g/squaremeter) | Classification _| Bad Bad jood A. OS) (R= Ratbaataiy | aS A (esonds) (igisquaremeter) | Classification My 3 7 2