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
(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
The algorithm described here is not quite the leader algorithm described in Hartigan which assigns a ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
908-M-S-D-A (8681).docx
120 KBs Word File
