Total No. of Questions : 8] SEAT No.

8
23
PA-913 [Total No. of Pages : 3

ic-
[5927]-343

tat
1s
B.E. (Computer)

5:1
02 91
MACHINE LEARNING

3:4
0
(2019 Pattern) (Semester - VII) (410242)

31
2/0 13
0
1/2
Time : 2½ Hours] [Max. Marks : 70
.23 GP

Instructions to the candidates:

E

1) Solve Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q6, Q.7 or Q.8.

81

8
C

23
2) Neat diagrams must be drawn wherever necessary.

ic-
3) Figures to the right indicate full marks.
16

tat
8.2

4) Make suitable assumption whenever necessary.

1s
.24

5:1
91
49

3:4
Q1) a) Explain in brief techniques to reduce under fitting and over fitting. [6]
30
31

b) Find the Equation of linear Regression line using following data : [6]
01
02

X Y
1/2
GP
2/0

1 3
CE
81

8
2 4

23
.23

3 5
ic-
16

tat
4 7
8.2

1s
.24

5:1

c) Write short note on : [6]

91
49

3:4

i) MAE
30
31

ii) RMSE
01
02

iii) R 2
1/2
GP
2/0

OR
CE
81

Q2) a) Explain in brief lasso and Ridge Regression. [6]

.23

b) What is Bias and variance trade off for machine learning model? [6]
16
8.2

c) Write short note on Evaluation metrics. [6]

.24
49

P.T.O.
Q3) a) Explain in brief methods used for Evaluating classification models.

8
[5]

23
ic-
b) Consider the following data to predict the student pass or fail using the

tat
K-Nearest Neighbor Algorithm (KNN) for the values physics = 6 marks,

1s
Chemistry = 8 marks with number of Neighbors K = 3. [6]

5:1
02 91
Physics (marks) Chemistry (marks) Results

3:4
0
4 3 Fail

31
2/0 13
6 7 Pass
0
1/2
.23 GP

7 8 Pass
5 5 Fail
E
81

8
C

23
8 8 Pass

ic-
16

tat
c) Write short note on Ensemble learing methods : [6]
8.2

1s
i) Simple
.24

5:1
91
ii) Advanced
49

3:4
30
31

OR
01
02

Q4) a) Explain Random forest Algorithm with example. [5]

1/2
GP

b) Write short note on importance of confusion matrix. [6]

2/0
CE

c) Define following terms with reference to SVM. [6]

81

8
23
.23

i) Separating hyperplane
ic-
16

tat
ii) Margin
8.2

1s
.24

5:1
91
49

Q5) a) Explain Density Based clustering with refence to DBSCAN, OPTICS

3:4
30

and DENCLUE. [6]

31
01

b) What is K mean clustering? Explain with example. [6]

02
1/2
GP

c) Write short note on following Hierarchical clustering method : [6]

2/0

i) Agglomerative
CE
81

ii) Dendogram
.23
16

OR
8.2
.24
49

[5927]-343 2
Q6) a) What is LOF? Explain it with it's advantages and disadvantages. [6]

8
23
b) Explain Graph Based clustering. [6]

ic-
c) Define following terms : [6]

tat
1s
i) Elbow method

5:1
02 91
ii) Extrinsic and Intrinsic method

3:4
0
31
2/0 13
Q7) a) Explain ANN with it's Architecture. [5]
0
1/2
.23 GP

b) Obtain the output of Neuron Y for the Network shown in following

fig. Using activation function as : [6]
E
81

8
C

23
i) Binary sigmoidal

ic-
ii) Bipolar sigmoidal
16

tat
8.2

1s
.24

5:1
91
49

3:4
30
31
01
02
1/2
GP
2/0
CE
81

8
23
c) Write short note on Back propagation network. [6]
.23

OR ic-
16

tat
8.2

1s

Q8) a) Explain in brief types of ANN based on layers. [5]

.24

5:1

b) What is Recurrent Neural Network? Explain with suitable example.

91
49

3:4

[6]
30
31

c) Write short note on with refernce with CNN. [6]

01
02

i) Convolution layer
1/2
GP
2/0

ii) Hidden layer

CE
81
.23


16
8.2
.24
49

[5927]-343 3