What benchmarks do you use for evaluating clustering algorithms, especially for evaluating the performance of K-means vs. another algorithm?
I am especially interested in looking at the correctness of results, meaning that I am looking for clustering problems that have a pretty good chance of K-means failing to find the optimum clustering.
I should also say that I am also looking for problems in a $n$-dimensional isotropic Euclidean space.
I have found some discussions in published literature, but I wanted to hear about as many perspectives as possible. If you had an algorithm and you wanted to compare it to K-means in terms of its ability to avoid local minima, you would need to test it with a reasonable probability that K-means would do just that, get stuck in a local minima. What kind of a test case would you suggest to give that reasonable probability?