Semester : SEMESTER 7
Subject : Machine Learning
Year : 2019
Term : MAY
Branch : COMPUTER SCIENCE AND ENGINEERING
Scheme : 2015 Full Time
Course Code : CS 467
Page:3
17
18
19
b)
a)
b)
a)
b)
G1163 Pages: 3
test returns a correct positive result in only 98% of the cases and a correct
negative result in only 97% of the cases. Furthermore, only 0.008 of the entire
population has this disease.
1. What is the probability that this patient has cancer?
2. What is the probability that he does not have cancer?
3. What is the diagnosis?
Discuss the issues involved in decision tree learning.
PART D
Answer any two full questions, each carries 12 marks.
Explain how Support Vector Machine can be used for classification of linearly
separable data.
Define Hidden Markov Model. What is meant by evaluation problem and how is
this solved?
Use K Means clustering to cluster the following data into two groups. Assume
cluster centroid are ൩1-52 and m2=4. The distance function used is Euclidean
distance. { 2,4, 10, 12, 3, 20, 30, 11, 25 }
Describe the concept on density based clustering and write the steps involved in
DBSCAN algorithm.
Describe the random forest algorithm to improve classifier accuracy.
For the given data points, construct the dendrogram using Complete Linkage
method.
Page 3083
(5)
(6)
(6)
(6)
(6)
(6)
(6)