For an application, I want to cluster data (potentially high dimensional) and extract probability of belonging to a cluster. I consider at the moment Self organizing maps or kernel k-means to do the job. What are the pros and cons of each classifier for this task? Am-I missing others clustering algorithms that could be performant in this case?


1 Answer 1


This has the potential to be an interesting question. Clustering algorithms perform 'well' or 'not-well' depending on the topology of your data and what you are looking for in that data. ¿What do you want the clusters to represent? I attach a diagram which sadly does not include kernel k-means or SOM but I think it is of great value for understanding the grave differences between the techniques. You probably need to ask and respond this to yourself before you dig in to measuring the "pros" and "cons".

clustering techniques This is the source of the image.

  • $\begingroup$ Thanks for the detailed anwser. I believe my intent would be to classify data more like the Affinity propagation. $\endgroup$
    – WAF
    Oct 31, 2013 at 9:41

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.