Professional Documents
Culture Documents
Save
In this post, I would be mainly discuss about the difference between Hierarchical
and Partitional clustering.
3. It then proceeds to merge each pair of closest clusters and computes the new
proximity amongst remaining clusters
Example of a Dendrogram
The K-Means clustering requires the analyst to define K number of clusters or the
number of iterations before running the algorithm. As such, it relies heavily on the
analyst’s knowledge to classify the clusters in a meaningful way.
1. The analyst selects the number of K clusters to be used as initial centroids or the
number of iterations for the algorithm to run (AKA: Stopping criterion)
3. With every iteration, the centroid distance for each cluster shifts and is updated