Question: Both (k)-means and (k)-medoids algorithms can perform effective clustering. a. Illustrate the strength and weakness of (k)-means in comparison with (k)-medoids. b. Illustrate the strength
Both \(k\)-means and \(k\)-medoids algorithms can perform effective clustering.
a. Illustrate the strength and weakness of \(k\)-means in comparison with \(k\)-medoids.
b. Illustrate the strength and weakness of these schemes in comparison with a hierarchical clustering scheme.
Step by Step Solution
3.30 Rating (168 Votes )
There are 3 Steps involved in it
a Strengths and Weaknesses of Kmeans and Kmedoids Kmeans Strengths It is simple to understand and easy to implement It is computationally efficient co... View full answer
Get step-by-step solutions from verified subject matter experts
