title: A Repetitive Branch-and-Bound Procedure for Minimum Within-Cluster Sums of Squares Partitioning.
abstract: Minimization of the within-cluster sums of squares (WCSS) is one of the most important optimization criteria in cluster analysis. Although cluster analysis modules in commercial software packages typically use heuristic methods for this criterion, optimal approaches can be computationally feasible for problems of modest size. This paper presents a new branch-and-bound algorithm for minimizing WCSS. Algorithmic enhancements include an effective reordering of objects and a repetitive solution approach that precludes the need for splitting the data set, while maintaining strong bounds throughout the solution process. The new algorithm provided optimal solutions for problems with up to 240 objects and eight well-separated clusters. Poorly separated problems with no inherent cluster structure were optimally solved for up to 60 objects and six clusters. The repetitive branch-and-bound algorithm was also successfully applied to three empirical data sets from the classification literature.
authors.affiliation: Florida State University, USA. mbrusco@cob.fsu.edu.|Marketing Department, College of Business, Florida State University, Tallahassee, FL, 32306-1110. mbrusco@cob.fsu.edu.
authors.forename: Michael J
authors.initials: MJ
authors.lastname: Brusco
keywords: K-means; branch and bound; cluster analysis; combinatorial data analysis