How does k-medoids algorithm cluster in data ?What are its advantages?
Answers
Answered by
1
K Meloid clustering is an algorithm based on partition. Its advantages are that it cansolve K- means problems and produce empty clusters and is sensitive to outliers or noise. It also selects the most centered member belonging to the cluster. Itsdisadvantages are that it requires precision and is complex enough.
Answered by
0
Explanation:
K Meloid clustering is an algorithm based on partition. Its advantages are that it can solve K- means problems and produce empty clusters and is sensitive to outliers or noise. It also selects the most centered member belonging to the cluster. Its disadvantages are that it requires precision and is complex enough
Similar questions