You're welcome! You can actually create a graph by using k-means similarities as edge weights. Then you do graph clustering on it. (using any algorithm, but lo

You're welcome! You can actually create a graph by using k-means similarities as edge weights. Then you do graph clustering on it. (using any algorithm, but louvain is one of the saner ones ... clique percolation, girvan-newman etc all have known problems).