Assignment 2

1. Using K-Means clustering algorithm to classify the dataset in 3 cluster

Dataset: {(2,2), (4,4), (6,6),(88,), (0,4), (3,0), (0,5), (5,5), (9,9),(10,10)}.

For starting the clustering, 3 centres are taken as c1(2,2), c2(5,5), c3(8,8)

Compute till there is no change of centre values.

2. Perform the agglomerative hierarchical clustering (explain each and every steps with
corresponding dendrogram and distance table) for the following initial distance table using:
a.Single/simple linkage. b. Complete linkage

3. Consider the following training data. Compute all the parameters required to design a Naïve
Bayes Classifier. Classify the test sample <Sepal. Length=7.2, Sepal. Width=3.6, Petal.
Width=2.5> using the Naïve Bayes classifier. Demonstrate all the steps followed to compute
the classifier parameters and to perform the classification of the test sample.