Question: 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

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.

Step by Step Solution

3.43 Rating (150 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

The algorithm described here is not quite the leader algorithm described in Hartigan which assigns a ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

908-M-S-D-A (8681).docx

120 KBs Word File

Students Have Also Explored These Related Statistics Questions!