Q7) Consider the following data set

D={ (2,0), (2,1), (1,2), (3,2), (2,3), (3,3), (2,4), (3,4), (4,4), (3,5) }

Apply K-means clustering withk=2, usingManhattan distance. Start with(2,0)and (3,5) as the initial centroids (seeds). Show all intermediate clusters, as well as the final clusters.

The initial centroid are (2, 0) and (3, 5)

Q8) Consider the following data set

Data = { <1,1> , <2,2>, <5, 2>, <6,1> }

(a) Cluster the data using agglomerative clustering technique withsingle linkage. Show the similarity (distance) matrix at each step. UseManhattan distance function.

(b) Cluster the data using agglomerative clustering technique withcomplete linkage. Show the similarity (distance) matrix at each step. UseManhattan distance function.

(c) Draw dendrogram usingsingle linkage. UseManhattan distance function.