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?
2 of 2
added 1 characters in body; edited title
Self organizing maps vs. kernel k-means
WAF
- 444
- 6
- 13