An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
An exact algorithm is proposed for minimum sum-of-squares nonhierarchical clustering, i.e., for partitioning a given set of points from a Euclidean m-space into a given number of clusters in order to minimize the sum of squared distances from all points to the centroid of the cluster to which they belong. …