Clustering n items into k classes corresponds to the choice of an ordering for the labels on the axes of the Gram matrix and the choice of k − 1 change points marking the boundaries between the blocks.
the search space of clusters is very large.