The leader algorithm (Hartigan [4]) represents each cluster using a point, known as a leader, and assigns each point to the cluster corresponding to the closest leader, unless this distance is above a user-specified threshold. In that case, the point becomes the leader of a new cluster.
(a) What are the advantages and disadvantages of the leader algorithm as compared to K-means?
(b) Suggest ways in which the leader algorithm might be improved.