Hello,I'm looking for some discussion on agglomerative and diversity initialization for K-Means algorithm because they are not clear in my mind. I understand that the final solution of the algorithm is affected by the initial clustering, so I set the number of restarts to the maximum (i.e.100) in order to report the best solution achieved. However, the solution still depends on the initialization, i.e. random, agglomerative and diversity. How to make the solution as robust as possible?Many thanks,Francesco