Hierarchical clustering
To make clusters within clusters.
Each data point belongs to many clusters.
Time-consuming and resource intensive.
Finding the distance between 2 clusters:-
Clusters = {C1, C2}
Max distance = max {d(x, y)} where x belongs to C1 and y belongs to...
vichuz373.hashnode.dev1 min read