A branch-and-cut SDP-based algorithm for minimum sum-of-squares clustering
Minimum sum-of-squares clustering (MSSC) consists in partitioning a given set of n points into k clusters in order to minimize the sum of squared distances from the points to the centroid of their cluster. Recently, Peng & Xia (2005) established the equivalence between 0-1 semidefinite progr...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Language: | eng |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382009000300002 |
| Country: | Brazil |
| Oai: | oai:scielo:S0101-74382009000300002 |