2 Hireacial Clustering

This help in clustering of data

Algorithm of hirearical clustering

Agglomerative or divisive clustering

hirearical clustering is used for _______ data set

Small

kmean vs hirearical interms of complexity

Steps involved in hirearical clustering

• for each data point we will consider it as seperate cluster

• Find the nearest point & create a new cluster

• keep on doing the same process until we get a single cluster

  • Later dendogram is created

Dendogram

to know how may cluster we need to make we use the dendogram.

how do we find the distance between deodogram line

we can use the Euclidean distance & Manhat distance.

how do we select the k value in dedogram

we use euclidean disatance