17

18

19

b)

a)
b)

a)

b)

a)

b)

17944 Pages: 3

approaches to tree pruning.?
Compute ML estimate for the parameter p in the binomial distribution whose

probability function is

n
f(x) = ( ‏0ھ(‎ (06-2 x = 0,1,2...71.
x

PART D

Answer any two full questions, each carries 12 marks.
Explain the basic problems associated with hidden markov model.
Describe the significance of soft margin hyperplane and optimal separating
hyperplane and explain how they are computed.
Suppose that the datamining task is to cluster the following seven points (with
(x,y) representing location) into two clusters Al(1,1), A2(1.5,2), A3(3,4),
A4(5,7), A5(3.5,5), A6(4.5,5), A7(3.5,4.5) The distance function is City block
distance. Suppose initially we assign Al,A5 as the centre for each cluster
respectively. Using the K-means algorithm to find the three clusters and their
centres after two round of execution.
Give the significance of kernel trick in the context of support vector machine.
Describe different types standard kernel functions.
Describe any one technique for Density based clustering with necessary
diagrams.
Given the following distance matrix, construct the dendogram using single
linkage, complete linkage and average linkage clustering algorithm.

Page 33

(4)

(6)
(6)

(6)

(6)
(6)

(6)